Characterizations of the Strong Basic Constraint Qualifications

Published Online:https://doi.org/10.1287/moor.1050.0154

References

  • Bauschke H. H., Borwein J. M., Li W. Strong conical hull intersection property, bounded linear regularity, Jameson’s property (G), and error bounds in convex optimization. Math. Programming (1999) 86:135–160CrossrefGoogle Scholar
  • Hiriart-Urruty J.-B., Lemaréchal C.Convex Analysis and Minimization Algorithms I (1993) (Springer-Verlag, Berlin, Heidelberg, Germany) CrossrefGoogle Scholar
  • Li C., Jin X.-Q. Nonlinearly constrained best approximation in Hilbert space: The strong CHIP and the basic constraint qualification. SIAM J. Optim. (2002) 13:228–239CrossrefGoogle Scholar
  • Li C., Ng K. F. Constraint qualification, the strong CHIP, and best approximation with convex constraints in Banach spaces. SIAM J. Optim. (2003) 14:584–607CrossrefGoogle Scholar
  • Li W. Abadie’s constraint qualification, metric regularity, and error bounds for differentiable convex inequalities. SIAM J. Optim. (1997) 7:966–978CrossrefGoogle Scholar
  • Li W., Nahak C., Singer I. Constraint qualifications for semi-infinite systems of convex inequalities. SIAM J. Optim. (2000) 11:31–52CrossrefGoogle Scholar
  • Pang J. S. Error bounds in mathematical programming. Math. Programming (1997) 79:299–332CrossrefGoogle Scholar
  • Robinson S. M. An application of error bounds for convex programming in a linear space. SIAM J. Control Optim. (1975) 13:271–273CrossrefGoogle Scholar
  • Rockafellar R. T.Convex Analysis (1970) (Princeton University Press, Princeton, NJ) CrossrefGoogle Scholar
  • Volle M. 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
  • Zheng X. Y., Ng K. F. Metric regularity and constraint qualifications for convex inequalities on Banach spaces. SIAM J. Optim. (2004) 14:757–772CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.