Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities

In this paper we study differentiable convex inequalities and prove that metric regularity and Abadie's constraint qualification (CQ) are equivalent for such inequalities. For convex quadratic inequalities, we show that metric regularity, the existence of a global error bound, and Abadie's CQ are mutually equivalent. As a consequence, we derive two new characterizations of weak sharp minima of a convex quadratic programming problem.

[1]  Wu Li.  A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines , 1996, Math. Program..

[2]  Michael C. Ferris,et al.  Minimum principle sufficiency , 1992, Math. Program..

[3]  Zhi-Quan Luo,et al.  Extension of Hoffman's Error Bound to Polynomial Systems , 1994, SIAM J. Optim..

[4]  A. Hoffman.  On approximate solutions of systems of linear inequalities , 1952 .

[5]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[6]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[7]  Abderrahim Jourani,et al.  Regularity and strong sufficient optimality conditions in differentiable optimization problems , 1993 .

[8]  William J. Cook,et al.  Sensitivity theorems in integer linear programming , 1986, Math. Program..

[9]  P. Pardalos,et al.  Gauss-seidel method for least-distance problems , 1992 .

[10]  J. Pang,et al.  Global error bounds for convex quadratic inequality systems , 1994 .

[11]  R. Cominetti.  Metric regularity, tangent sets, and second-order optimality conditions , 1990 .

[12]  P. Tseng,et al.  On the convergence of the coordinate descent method for convex differentiable minimization , 1992 .

[13]  S. M. Robinson.  An Application of Error Bounds for Convex Programming in a Linear Space , 1975 .

[14]  Paul Tseng,et al.  Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem , 1992, SIAM J. Optim..

[15]  P. Tseng,et al.  On the linear convergence of descent methods for convex essentially smooth minimization , 1992 .

[16]  Olvi L. Mangasarian,et al.  A Condition Number for Differentiable Convex Inequalities , 1985, Math. Oper. Res..

[17]  D. Klatte,et al.  A note of Lipschitz constants for solutions of linear inequalities and equations , 1996 .

[18]  O. Mangasarian,et al.  Lipschitz continuity of solutions of linear inequalities, programs and complementarity problems , 1987 .

[19]  James V. Burke,et al.  A Unified Analysis of Hoffman's Bound via Fenchel Duality , 1996, SIAM J. Optim..

[20]  Diethard Klatte,et al.  Error bounds for solutions of linear equations and inequalities , 1995, Math. Methods Oper. Res..

[21]  W. Li.  Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines , 1995 .

[22]  J. Abadie.  ON THE KUHN-TUCKER THEOREM. , 1966 .

[23]  Wu Li.  Error Bounds for Piecewise Convex Quadratic Programs and Applications , 1995 .

[24]  P. Tseng,et al.  On the convergence of a matrix splitting algorithm for the symmetric monotone linear complementarity problem , 1991 .

[25]  Olvi L. Mangasarian.  Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem , 1991, SIAM J. Optim..

[26]  Alfred Auslender,et al.  Global Regularity Theorems , 1988, Math. Oper. Res..

[27]  I. Singer,et al.  The distance to a polyhedron , 1992 .

[28]  Wu Li.  Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem , 1993, SIAM J. Optim..

[29]  S. M. Robinson.  Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems , 1976 .

[30]  Z.-Q. Luo,et al.  Error bounds and convergence analysis of feasible descent methods: a general approach , 1993, Ann. Oper. Res..