Error bounds in mathematical programming

Originated from the practical implementation and numerical considerations of iterative methods for solving mathematical programs, the study of error bounds has grown and proliferated in many interesting areas within mathematical programming. This paper gives a comprehensive, state-of-the-art survey of the extensive theory and rich applications of error bounds for inequality and optimization systems and solution sets of equilibrium problems.

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

[2]  L. Hörmander.  On the division of distributions by polynomials , 1958 .

[3]  S. Łojasiewicz.  Sur le problème de la division , 1959 .

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

[5]  W. Zangwill.  Non-Linear Programming Via Penalty Functions , 1967 .

[6]  R. Wets,et al.  A Lipschitzian characterization of convex polyhedra , 1969 .

[7]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

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

[9]  C. Ursescu.  Multifunctions with convex closed graph , 1975 .

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

[11]  Stephen M. Robinson,et al.  Regularity and Stability for Convex Multivalued Functions , 1976, Math. Oper. Res..

[12]  D. Bertsekas,et al.  Combined Primal–Dual and Penalty Methods for Convex Programming , 1976 .

[13]  G. M. Korpelevich.  The extragradient method for finding saddle points and other problems , 1976 .

[14]  A. Auslender.  Optimisation : méthodes numériques , 1976 .

[15]  Stephen M. Robinson,et al.  Strongly Regular Generalized Equations , 1980, Math. Oper. Res..

[16]  J. Dunn.  Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes , 1981 .

[17]  S. M. Robinson.  Some continuity properties of polyhedral multifunctions , 1981 .

[18]  Donald W. Hearn,et al.  The gap function of a convex program , 1982, Operations Research Letters.

[19]  D. Bertsekas,et al.  Projection methods for variational inequalities with application to the traffic assignment problem , 1982 .

[20]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[21]  F. Luque.  Asymptotic convergence analysis of the proximal point algorithm , 1984 .

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

[23]  J. Borwein.  Stability and regular points of inequality systems , 1986 .

[24]  Olvi L. Mangasarian,et al.  Error bounds for monotone linear complementarity problems , 1986, Math. Program..

[25]  Jong-Shi Pang,et al.  Inexact Newton methods for the nonlinear complementarity problem , 1986, Math. Program..

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

[27]  Jong-Shi Pang,et al.  A Posteriori Error Bounds for the Linearly-Constrained Variational Inequality Problem , 1987, Math. Oper. Res..

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

[29]  E. Bierstone,et al.  Semianalytic and subanalytic sets , 1988 .

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

[31]  J. Pang,et al.  Two-stage parallel iterative methods for the symmetric linear complementarity problem , 1988 .

[32]  J. Borwein,et al.  Verifiable necessary and sufficient conditions for openness and regularity of set-valued and single-valued maps , 1988 .

[33]  J. J. Moré,et al.  On the identification of active constraints , 1988 .

[34]  Giles Auchmuty.  Variational principles for variational inequalities , 1989 .

[35]  Richard S. Bassein,et al.  An Optimization Problem , 1989 .

[36]  L. Grippo,et al.  Exact penalty functions in constrained optimization , 1989 .

[37]  J. Penot.  Metric regularity, openness and Lipschitzian behavior of multifunctions , 1989 .

[38]  A. Auslender,et al.  Well Behaved Asymptotical Convex Functions , 1989 .

[39]  J. Burke.  On identification of active constraints II: the nonconvex case , 1990 .

[40]  Patrick T. Harker,et al.  Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications , 1990, Math. Program..

[41]  J. Pang,et al.  Error bounds for the linear complementarity problem with a P-matrix , 1990 .

[42]  Olvi L. Mangasarian,et al.  Error bounds for nondegenerate monotone linear complementarity problems , 1990, Math. Program..

[43]  J. Burke.  An exact penalization viewpoint of constrained optimization , 1991 .

[44]  Alfredo N. Iusem.  On Dual Convergence and the Rate of Primal Convergence of Bregman's Convex Programming Method , 1991, SIAM J. Optim..

[45]  Osman Güer.  On the convergence of the proximal point algorithm for convex minimization , 1991 .

[46]  Stephen M. Robinson,et al.  An Implicit-Function Theorem for a Class of Nonsmooth Functions , 1991, Math. Oper. Res..

[47]  Michael C. Ferris,et al.  Finite termination of the proximal point algorithm , 1991, Math. Program..

[48]  Paul Tseng,et al.  On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm , 1991, SIAM J. Optim..

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

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

[51]  J. Warga.  A Necessary and Sufficient Condition for a Constrained Minimum , 1992, SIAM J. Optim..

[52]  A. Hoffmann.  The Distance to the Intersection of Two Convex Sets Expressed by the Distances to Each of Them , 1992 .

[53]  G. Isac.  Complementarity Problems , 1992 .

[54]  Richard W. Cottle,et al.  Linear Complementarity Problem. , 1992 .

[55]  Jong-Shi Pang,et al.  An inexact NE/SQP method for solving the nonlinear complementarity problem , 1992, Comput. Optim. Appl..

[56]  Masao Fukushima,et al.  Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems , 1992, Math. Program..

[57]  J. Dedieu.  Penalty functions in subanalytic optimization , 1992 .

[58]  M. Seetharama Gowda,et al.  On the Continuity of the Solution Map in Linear Complementarity Problems , 1992, SIAM J. Optim..

[59]  Stephen M. Robinson,et al.  Normal Maps Induced by Linear Transformations , 1992, Math. Oper. Res..

[60]  O. Mangasarian.  Global error bounds for monotone affine variational inequality problems , 1992 .

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

[62]  Paul Tseng,et al.  On the convergence of the affine-scaling algorithm , 1992, Math. Program..

[63]  A. Fischer.  A special newton-type optimization method , 1992 .

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

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

[66]  T. Zolezzi,et al.  Well-Posed Optimization Problems , 1993 .

[67]  Roberto Cominetti,et al.  Convex Functions with Unbounded Level Sets and Applications to Duality Theory , 1993, SIAM J. Optim..

[68]  Masao Fukushima,et al.  A globally convergent Newton method for solving strongly monotone variational inequalities , 1993, Math. Program..

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

[70]  B. Mordukhovich.  Complete characterization of openness, metric regularity, and Lipschitzian properties of multifunctions , 1993 .

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

[72]  Wu Li.  The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program , 1993 .

[73]  Olvi L. Mangasarian,et al.  Nonlinear complementarity as unconstrained and constrained minimization , 1993, Math. Program..

[74]  Paul Tseng,et al.  On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization , 1993, Math. Oper. Res..

[75]  M. Ferris,et al.  Weak sharp minima in mathematical programming , 1993 .

[76]  Jong-Shi Pang,et al.  NE/SQP: A robust algorithm for the nonlinear complementarity problem , 1993, Math. Program..

[77]  Paul Tseng,et al.  Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set , 1993, SIAM J. Optim..

[78]  Stephen J. Wright.  Identifiable Surfaces in Constrained Optimization , 1993 .

[79]  A. Auslender.  Convergence of stationary sequences for variational inequalities with maximal monotone operators , 1993 .

[80]  Michael C. Ferris,et al.  Error bounds and strong upper semicontinuity for monotone affine variational inequalities , 1993, Ann. Oper. Res..

[81]  D. Ralph.  A new proof of Robinson's homeomorphism theorem for pl-normal maps , 1993 .

[82]  Zhi-Quan Luo,et al.  Error bounds for analytic systems and their applications , 1994, Math. Program..

[83]  Paul Tseng,et al.  Partial Proximal Minimization Algorithms for Convex Pprogramming , 1994, SIAM J. Optim..

[84]  Zhi-Quan Luo,et al.  On the rate of convergence of a distributed asynchronous routing algorithm , 1994, IEEE Trans. Autom. Control..

[85]  P. Tseng,et al.  Perturbation Analysis of a Condition Number for Linear Systems , 1994, SIAM J. Matrix Anal. Appl..

[86]  Olvi L. Mangasarian.  Error bounds for inconsistent linear inequalities and programs , 1994, Oper. Res. Lett..

[87]  Olvi L. Mangasarian,et al.  New Error Bounds for the Linear Complementarity Problem , 1994, Math. Oper. Res..

[88]  Olvi L. Mangasarian,et al.  New improved error bounds for the linear complementarity problem , 1994, Math. Program..

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

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

[91]  Yin Zhang,et al.  A Study of Indicators for Identifying Zero Variables in Interior-Point Methods , 1994, SIAM Rev..

[92]  J. Pang,et al.  On the Boundedness and Stability of Solutions to the Affine Variational Inequality Problem , 1994 .

[93]  Stephen J. Wright,et al.  Local convergence of interior-point algorithms for degenerate monotone LCP , 1994, Comput. Optim. Appl..

[94]  O L Mangasarian.  The Ill-Posed Linear Complementarity Problem , 1995 .

[95]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[96]  A. Fischer.  An NCP–Function and its Use for the Solution of Complementarity Problems , 1995 .

[97]  A. Fiacco,et al.  Survey of penalty, exact-penalty and multiplier methods from 1968 to 1993 ∗ , 1995 .

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

[99]  F. Facchinei,et al.  Exact barrier function methods for Lipschitz programs , 1995 .

[100]  Uriel G. Rothblum,et al.  Approximations to Solutions to Systems of Linear Inequalities , 1995, SIAM J. Matrix Anal. Appl..

[101]  A. Lotov.  An estimate of solution setperturabations for a system of linear inequalities , 1995 .

[102]  Marc Teboulle,et al.  Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming , 1995, Math. Oper. Res..

[103]  Shinji Hara,et al.  Interior Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices , 1995 .

[104]  Z. Luo.  CONVERGENCE ANALYSIS OF PRIMAL-DUAL INTERIOR POINT ALGORITHMS FOR CONVEX QUADRATIC PROGRAMS , 1995 .

[105]  P. Tseng.  On linear convergence of iterative methods for the variational inequality problem , 1995 .

[106]  D. Du,et al.  Recent Advances in Nonsmooth Optimization , 1995 .

[107]  Zhi-Quan Luo,et al.  Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints , 1996, Math. Program..

[108]  M. Ferris,et al.  Nondegenerate Solutions and Related Concepts in Affine Variational Inequalities , 1996 .

[109]  Andreas Fischer,et al.  On finite termination of an iterative method for linear complementarity problems , 1996, Math. Program..

[110]  Stefan Scholtes,et al.  Homeomorphism Conditions for Coherently Oriented Piecewise Affine Mappings , 1996, Math. Oper. Res..

[111]  A. Odlyzko.  Asymptotic enumeration methods , 1996 .

[112]  Heinz H. Bauschke,et al.  On Projection Algorithms for Solving Convex Feasibility Problems , 1996, SIAM Rev..

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

[114]  R. Monteiro,et al.  Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem , 1996 .

[115]  Marco Sabatini,et al.  LipschitzianQ-matrices areP-matrices , 1996, Math. Program..

[116]  J. Sturm.  Superlinear convergence of an algorithm for monotone linear complementarity problems, when no strictly complementary solution exists , 1996 .

[117]  R. Tyrrell Rockafellar,et al.  Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets , 1996, SIAM J. Optim..

[118]  M. Fukushima.  Merit Functions for Variational Inequality and Complementarity Problems , 1996 .

[119]  M. Seethharama Gowda,et al.  An Analysis of Zero Set and Global Error Bound Properties of a Piecewise Affine Function via Its Recession Function , 1996, SIAM J. Matrix Anal. Appl..

[120]  Olvi L. Mangasarian,et al.  Exact Penalty Functions for Mathematical Programs with Linear Complementarity Constraints , 1996 .

[121]  Bethany L. Nicholson,et al.  Mathematical Programs with Equilibrium Constraints , 2021, Pyomo — Optimization Modeling in Python.

[122]  M. Fukushima,et al.  Equivalence of the generalized complementarity problem to differentiable unconstrained minimization , 1996 .

[123]  M. Seetharama Gowda,et al.  On the Lipschitzian properties of polyhedral multifunctions , 1996, Math. Program..

[124]  Jong-Shi Pang,et al.  Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps , 1996, Math. Oper. Res..

[125]  K. Taji,et al.  Unconstrained Optimization Reformulations of Variational Inequality Problems , 1997 .

[126]  S Scholtes,et al.  Mathematical programs with equilibrium constraints: stationarity, optimality, and sensitivity , 1997 .

[127]  M. Fukushima,et al.  Equivalent Unconstrained Minimization and Global Error Bounds for Variational Inequality Problems , 1997 .

[128]  Wu Li,et al.  Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities , 1997, SIAM J. Optim..

[129]  Michael C. Ferris,et al.  Complementarity and variational problems : state of the art , 1997 .

[130]  M. Fukushima,et al.  New NCP-Functions and Their Properties , 1997 .

[131]  Sien Deng.  Computable Error Bounds For Convex Inequality Systems In Reflexive Banach Spaces , 1997, SIAM J. Optim..

[132]  Ji-Ming Peng,et al.  Equivalence of variational inequality problems to unconstrained minimization , 1997, Math. Program..

[133]  Michael C. Ferris,et al.  Engineering and Economic Applications of Complementarity Problems , 1997, SIAM Rev..

[134]  Shinji Hara,et al.  Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices , 1997, SIAM J. Optim..

[135]  S. Deng.  Global Error Bounds for Convex Inequality Systems in Banach Spaces , 1998 .

[136]  Olvi L. Mangasarian.  Error bounds for nondifferentiable convex inequalities under a strong Slater constraint qualification , 1998, Math. Program..

[137]  Wu Li,et al.  Global Error Bounds for Convex Multifunctions and Applications , 1998, Math. Oper. Res..

[138]  Francisco Facchinei,et al.  On the Accurate Identification of Active Constraints , 1998, SIAM J. Optim..

[139]  M. Seetharama Gowda,et al.  Nondegeneracy Concepts for Zeros of Piecewise Smooth Functions , 1998, Math. Oper. Res..

[140]  Zhi-Quan Luo,et al.  Superlinear Convergence of a Symmetric Primal-Dual Path Following Algorithm for Semidefinite Programming , 1998, SIAM J. Optim..

[141]  A. Lewis,et al.  Error Bounds for Convex Inequality Systems , 1998 .

[142]  Renato D. C. Monteiro,et al.  On Two Interior-Point Mappings for Nonlinear Semidefinite Complementarity Problems , 1998, Math. Oper. Res..

[143]  Francisco Facchinei,et al.  Convergence to Second Order Stationary Points in Inequality Constrained Optimization , 1998, Math. Oper. Res..

[144]  J. Pang,et al.  Minimizing and Stationary Sequences of Constrained Optimization Problems , 1998 .