Characterizations of the Strong Basic Constraint Qualifications
Published Online:1 Nov 2005https://doi.org/10.1287/moor.1050.0154
References
- Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization. Math. Programming (1999) 86:135–160Crossref, Google Scholar
- Convex Analysis and Minimization Algorithms I (1993) (Springer-Verlag, Berlin, Heidelberg, Germany) Crossref, Google Scholar
- Nonlinearly constrained best approximation in Hilbert space: The strong CHIP and the basic constraint qualification. SIAM J. Optim. (2002) 13:228–239Crossref, Google Scholar
- Constraint qualification, the strong CHIP, and best approximation with convex constraints in Banach spaces. SIAM J. Optim. (2003) 14:584–607Crossref, Google Scholar
- Abadie’s constraint qualification, metric regularity, and error bounds for differentiable convex inequalities. SIAM J. Optim. (1997) 7:966–978Crossref, Google Scholar
- Constraint qualifications for semi-infinite systems of convex inequalities. SIAM J. Optim. (2000) 11:31–52Crossref, Google Scholar
- Error bounds in mathematical programming. Math. Programming (1997) 79:299–332Crossref, Google Scholar
- An application of error bounds for convex programming in a linear space. SIAM J. Control Optim. (1975) 13:271–273Crossref, Google Scholar
- Convex Analysis (1970) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
- Sous-différentiel d’une enveloppe supérieure de fonctions convexes. C.R. Acad. Sci. Paris Sér. I Math. (1993) 317:845–849Google Scholar
- Metric regularity and constraint qualifications for convex inequalities on Banach spaces. SIAM J. Optim. (2004) 14:757–772Crossref, Google Scholar

