Constraint Qualifications Characterizing Lagrangian Duality in Convex Optimization

V. Jeyakumar ()
Additional contact information
V. Jeyakumar: University of New South Wales

Journal of Optimization Theory and Applications, 2008, vol. 136, issue 1, No 3, 41 pages

Abstract: Abstract In convex optimization, a constraint qualification (CQ) is an essential ingredient for the elegant and powerful duality theory. Various constraint qualifications which are sufficient for the Lagrangian duality have been given in the literature. In this paper, we present constraint qualifications which characterize completely the Lagrangian duality.

Keywords: Convex programming; Constraint qualifications; Lagrangian duality; Necessary and sufficient conditions (search for similar items in EconPapers)
Date: 2008
References: View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://link.springer.com/10.1007/s10957-007-9294-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:136:y:2008:i:1:d:10.1007_s10957-007-9294-x

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-007-9294-x

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().