24
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

Duality in convex programming: a linearization approachFootnote1

&
Pages 171-178 | Published online: 27 Jun 2007
 

Abstract

We propose a local linearization of convex programs, and a corresponding duality theory, which retains the properties of classical duality without assuming constraint qualification.

1Research partly supported by the National Research Council of Canada and by NSF Grant Eng 77-10126.

1Research partly supported by the National Research Council of Canada and by NSF Grant Eng 77-10126.

Notes

1Research partly supported by the National Research Council of Canada and by NSF Grant Eng 77-10126.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.