Error bounds for nondegenerate monotone linear complementarity problems
From MaRDI portal
Publication:753691
DOI10.1007/BF01582267zbMath0716.90094OpenAlexW2066932332MaRDI QIDQ753691
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582267
Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Superlinear convergence of infeasible-interior-point methods for linear programming, New improved error bounds for the linear complementarity problem, Error bounds for inconsistent linear inequalities and programs, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Error bounds in mathematical programming, A path-following interior-point algorithm for linear and quadratic problems, A superquadratic infeasible-interior-point method for linear complementarity problems, Error bounds for solutions of linear equations and inequalities, Further discussion on the error bound for generalized linear complementarity problem over a polyhedral cone, Error Bound Characterizations of the Conical Constraint Qualification in Convex Programming, On finite convergence of iterative methods for variational inequalities in Hilbert spaces, Characterizing the solution set of convex optimization problems without convexity of constraints, Stability analysis of one stage stochastic mathematical programs with complementarity constraints, Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints, The solution set characterization and error bound for the extended mixed linear complementarity problem, Finite termination of the proximal point algorithm in Banach spaces, Finite termination of the proximal point algorithm, Finite convergence of the proximal point algorithm for variational inequality problems, Finite termination of inexact proximal point algorithms in Hilbert spaces, On a global projection-type error bound for the linear complementarity problem, Global error bounds for monotone affine variational inequality problems, On a global error bound for a class of monotone affine variational inequality problems, Minimum principle sufficiency, A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions, Weak sharpness for set-valued variational inequalities and applications to finite termination of iterative algorithms, On convergence of the proximal point algorithm in Banach spaces, Global error bound for the generalized linear complementarity problem over a polyhedral cone, Growth behavior of a class of merit functions for the nonlinear complementarity problem, An improvement on the global error bound estimation for ELCP and its applications, Error bounds and convergence analysis of feasible descent methods: A general approach, Error bounds and strong upper semicontinuity for monotone affine variational inequalities, Global error bounds for convex quadratic inequality systems*
Cites Work
- A simple characterization of solutions sets of convex programs
- Finite termination of the proximal point algorithm
- Complementary pivot theory of mathematical programming
- Nonlinear Perturbation of Linear Programs
- Characterizations of bounded solutions of linear complementarity problems
- Monotone Operators and the Proximal Point Algorithm
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for monotone linear complementarity problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
