1990
DOI: 10.1137/0328051
|View full text |Cite
|
Sign up to set email alerts
|

A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
45
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 63 publications
(45 citation statements)
references
References 8 publications
0
45
0
Order By: Relevance
“…As shown by Gowda and Teboulle (1990) and Zȃlinescu (1999), the strong quasirelative interior condition (16) and our condition (14) based on the intrinsic core are related to each other by the following equivalence:…”
Section: (Bl)mentioning
confidence: 99%
See 3 more Smart Citations
“…As shown by Gowda and Teboulle (1990) and Zȃlinescu (1999), the strong quasirelative interior condition (16) and our condition (14) based on the intrinsic core are related to each other by the following equivalence:…”
Section: (Bl)mentioning
confidence: 99%
“…Thus, our constraint qualification condition (14) is strictly weaker than that of Gowda and Teboulle (1990) in (16) (which we recall again is the generalization of the constraint qualification condition by Borwein and Lewis (1993) that works for problems with conditional moment restrictions). Specifically, our condition (14) does not involve any closedness requirements.…”
Section: (Bl)mentioning
confidence: 99%
See 2 more Smart Citations
“…If the interior-point condition that (int D) ∩ C = ∅ (or its recent generalization that the cone generated by (C − D), cone(C − D), is a closed subspace [13,15,10]) is satisfied or the bounded linear regularity condition [4,5], when X is a Euclidean space, is satisfied, then the normal cone intersection formula …”
Section: Introductionmentioning
confidence: 99%