Simple computable bounds for solutions of linear complementarity problems and linear programs

DOI10.1007/BFb0121071zbMath0582.90098OpenAlexW1517309053MaRDI QIDQ3707783

Olvi L. Mangasarian

Publication date: 1985

Published in: Mathematical Programming Essays in Honor of George B. Dantzig Part II (Search for Journal in Brave)

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

zbMATH Keywords

feasible pointpositive semidefinite linear complementarity problem

Mathematics Subject Classification ID

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

Related Items

Bounds for the solution set of linear complementarity problems, Error bounds for analytic systems and their applications, A polynomial-time algorithm for a class of linear complementarity problems, Condition numbers for polyhedra with real number data, On sensitivity analysis for multicriteria optimization, Error bounds for the linear complementarity problem with a P-matrix, The numerical range theory and boundedness of solutions of the complementarity problem, The numerical range theory and boundedness of solutions of the complementarity problem, Error bounds for inequality systems defining convex sets, Complexity analysis of a linear complementarity algorithm based on a Lyapunov function, Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem, Error bounds for monotone linear complementarity problems, Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs, Simple bounds for solutions of monotone complementarity problems and convex programs