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 language | English |
|---|---|
| Pages (from-to) | 925-935 |
| Number of pages | 11 |
| Journal | SIAM Journal on Control and Optimization |
| Volume | 28 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1990 |
| Externally published | Yes |