In this chapter we present convex programming optimality conditions in both sadde point form and Karush--Kuhn--Tucker form for mathematical programming, and also optimality conditions for cone-constrained convex programs and for conic problems. We conclude the chapter by revisiting linear programming duality as a special case of conic duality and reproducing the classical results on the dual of a linearly constrained convex quadratic minimization problem.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.