Global error bounds for convex quadratic inequality systems*

DOI10.1080/02331939408844003zbMath0817.90078OpenAlexW2072058266MaRDI QIDQ4764592

Tao Wang, Jong-Shi Pang

Publication date: 8 May 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939408844003

zbMATH Keywords

global error boundsystem of convex quadratic inequalities

Mathematics Subject Classification ID

Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

How to deal with the unbounded in optimization: Theory and algorithms, Error bounds in mathematical programming, Nonlocal error bounds for piecewise affine functions, Global error bounds for piecewise convex polynomials, Convergence Rate of Inexact Proximal Point Algorithms for Operator with Hölder Metric Subregularity, Exact penalty and error bounds in DC programming, Coercive polynomials: stability, order of growth, and Newton polytopes, Enhanced efficiency in multi-objective optimization, Error bounds for systems of lower semicontinuous functions in Asplund spaces, A sharper global error bound for the generalized nonlinear complementarity problem over a polyhedral cone, Error bounds via exact penalization with applications to concave and quadratic systems, Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem, Abadie's constraint qualification, Hoffman's error bounds, and Hausdorff strong unicity, Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems, Global Error Bounds for Systems of Convex Polynomials over Polyhedral Constraints, Error bounds for convex differentiable inequality systems in Banach spaces, Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem

Cites Work

• Error bounds for nondegenerate monotone linear complementarity problems
• A simple characterization of solutions sets of convex programs
• A Condition Number for Differentiable Convex Inequalities
• An Application of Error Bounds for Convex Programming in a Linear Space
• Extension of Hoffman’s Error Bound to Polynomial Systems
• New Error Bounds for the Linear Complementarity Problem
• Error bounds for monotone linear complementarity problems