This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...

can be solved by solving an equivalent linear complementarity problem when H is positive semidefinite. The approach is outlined in the discussion of the LCP subroutine in Chapter 17, "Language ...

Quadratic programming has a variety of applications, such as resource planning, portfolio optimization, and structural analysis. Download this technical whitepaper on the sparse convex quadratic ...