In this chapter, we (a) introduce the notion of a convex problem in cone-constrained form, (b) present the Lagrange function of a cone-constrained convex problem, (c) prove the convex programming Duality Theorem in cone-constrained form, and (d) discuss conic programming and conic duality, and present the conic programming Duality Theorem.
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.