New improved error bounds for the linear complementarity problem

DOI10.1007/BF01581148zbMath0829.90124OpenAlexW2088109187MaRDI QIDQ1340062

V. Pereyra

Publication date: 17 January 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01581148

zbMATH Keywords

error bounds

Mathematics Subject Classification ID

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

Related Items (32)

Error bounds for complementarity problems with tridiagonal nonlinear functions ⋮ Error bounds for inconsistent linear inequalities and programs ⋮ Error bounds in mathematical programming ⋮ Improved error bounds based on \(\alpha (M)\) for the linear complementarity problem ⋮ Smoothing methods for convex inequalities and linear complementarity problems ⋮ Exact computation of an error bound for the balanced linear complementarity problem with unique solution ⋮ Error Estimation for Nonlinear Complementarity Problems via Linear Systems with Interval Data ⋮ Stability analysis of one stage stochastic mathematical programs with complementarity constraints ⋮ Error bounds and a condition number for the absolute value equations ⋮ Global error bounds for the extended vertical LCP ⋮ Pure characteristics demand models and distributionally robust mathematical programs with stochastic complementarity constraints ⋮ Error bounds for nonlinear complementarity problems with band structure ⋮ The solution set characterization and error bound for the extended mixed linear complementarity problem ⋮ On a global projection-type error bound for the linear complementarity problem ⋮ The iterative methods for monotone generalized variational inequalities ⋮ Unnamed Item ⋮ Complementary problems with polynomial data ⋮ Robust solution of monotone stochastic linear complementarity problems ⋮ Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems. ⋮ Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs ⋮ New reformulation and feasible semismooth Newton method for a class of stochastic linear complementarity problems ⋮ Computation of error bounds for P-matrix linear complementarity problems ⋮ Expected residual minimization method for monotone stochastic tensor complementarity problem ⋮ A sharper global error bound for the generalized linear complementarity problem over a polyhedral cone under weaker conditions ⋮ Complexity of a noninterior path-following method for the linear complementarity problem ⋮ Global projection-type error bounds for general variational inequalities ⋮ The linear complementarity problem as a separable bilinear program ⋮ 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 ⋮ Equivalence of the generalized complementarity problem to differentiable unconstrained minimization ⋮ An improvement on the global error bound estimation for ELCP and its applications ⋮ Active-set prediction for interior point methods using controlled perturbations

Cites Work

• Unnamed Item
• Error bounds for nondegenerate monotone linear complementarity problems
• Error bounds for the linear complementarity problem with a P-matrix
• Global error bounds for monotone affine variational inequality problems
• Some continuity properties of polyhedral multifunctions
• Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
• New Error Bounds for the Linear Complementarity Problem
• Error bounds for monotone linear complementarity problems
• Inexact Newton methods for the nonlinear complementarity problem

This page was built for publication: New improved error bounds for the linear complementarity problem