Comparison of constraint qualifications in infinite-dimensional convex programming

M. Seetharama Gowda*, Marc Teboulle

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper the relationships between various constraint qualifications infinite-dimensional convex programs are investigated. Using Robinson's refinement of the duality result of Rockafeller, it is demonstrated that the constraint qualification proposed by Rockafellar provides a systematic mechanism for comparing many constraint qualifications as well as establishing new results in different topological environments.

Original languageEnglish
Pages (from-to)925-935
Number of pages11
JournalSIAM Journal on Control and Optimization
Volume28
Issue number4
DOIs
StatePublished - 1990
Externally publishedYes

Fingerprint

Dive into the research topics of 'Comparison of constraint qualifications in infinite-dimensional convex programming'. Together they form a unique fingerprint.

Cite this