Error bounds for inconsistent linear inequalities and programs
From MaRDI portal
Publication:1342080
DOI10.1016/0167-6377(94)90076-0zbMath0814.90082OpenAlexW2054940342MaRDI QIDQ1342080
Publication date: 11 January 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: http://digital.library.wisc.edu/1793/59760
Related Items
Best approximate solutions of inconsistent linear inequality systems, Error bounds in mathematical programming, Smoothing methods for convex inequalities and linear complementarity problems, Error bounds for rank constrained optimization problems and applications
Cites Work
- Error bounds for nondegenerate monotone linear complementarity problems
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Global error bounds for monotone affine variational inequality problems
- On a global error bound for a class of monotone affine variational inequality problems
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- On the convergence of the coordinate descent method for convex differentiable minimization
- New improved error bounds for the linear complementarity problem
- Bounds for error in the solution set of a perturbed linear program
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- Weak Sharp Minima in Mathematical Programming
- Some continuity properties of polyhedral multifunctions
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- New Error Bounds for the Linear Complementarity Problem
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- Error bounds for monotone linear complementarity problems
- Inexact Newton methods for the nonlinear complementarity problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
