Simple computable bounds for solutions of linear complementarity problems and linear programs
From MaRDI portal
Recommendations
- Simple bounds for solutions of monotone complementarity problems and convex programs
- Bounds for the solution set of linear complementarity problems
- Acceptable solutions of linear complementarity problems
- Solution of linear complementarity problems using minimization with simple bounds
- scientific article; zbMATH DE number 617262
Cited in
(16)- Error bounds for monotone linear complementarity problems
- The numerical range theory and boundedness of solutions of the complementarity problem
- Complexity analysis of a linear complementarity algorithm based on a Lyapunov function
- A combinatorial bound for linear programming and related problems
- scientific article; zbMATH DE number 617262 (Why is no real title available?)
- On sensitivity analysis for multicriteria optimization
- Error bounds for analytic systems and their applications
- A polynomial-time algorithm for a class of linear complementarity problems
- Error bounds for the linear complementarity problem with a P-matrix
- Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
- Error bounds for inequality systems defining convex sets
- Simple bounds for solutions of monotone complementarity problems and convex programs
- Computable numerical bounds for Lagrange multipliers of stationary points of nonconvex differentiable nonlinear programs
- Condition numbers for polyhedra with real number data
- The numerical range theory and boundedness of solutions of the complementarity problem
- Bounds for the solution set of linear complementarity problems
This page was built for publication: Simple computable bounds for solutions of linear complementarity problems and linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3707783)
