Error bounds for inconsistent linear inequalities and programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 955453 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 3797486 (Why is no real title available?)
- Bounds for error in the solution set of a perturbed linear program
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Error Bound and Reduced-Gradient Projection Algorithms for Convex Minimization over a Polyhedral Set
- Error bounds and strong upper semicontinuity for monotone affine variational inequalities
- Error bounds for monotone linear complementarity problems
- Error bounds for nondegenerate monotone linear complementarity problems
- Error bounds for strongly convex programs and (super)linearly convergent iterative schemes for the least 2-norm solution of linear programs
- Extension of Hoffman’s Error Bound to Polynomial Systems
- Global error bounds for monotone affine variational inequality problems
- Inexact Newton methods for the nonlinear complementarity problem
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
- Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
- More results on the convergence of iterative methods for the symmetric linear complementarity problem
- New Error Bounds for the Linear Complementarity Problem
- New improved error bounds for the linear complementarity problem
- On a global error bound for a class of monotone affine variational inequality problems
- On the Convergence Rate of Dual Ascent Methods for Linearly Constrained Convex Minimization
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- On the convergence of the coordinate descent method for convex differentiable minimization
- Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
- Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
- Some continuity properties of polyhedral multifunctions
- Weak Sharp Minima in Mathematical Programming
Cited in
(8)- Error bounds for rank constrained optimization problems and applications
- Error bounds in mathematical programming
- Error bounds for solutions of linear equations and inequalities
- Error Bounds for Linear Matrix Inequalities
- A posteriori error bounds in linear programming aggregation
- Smoothing methods for convex inequalities and linear complementarity problems
- Best approximate solutions of inconsistent linear inequality systems
- Convergence and error bound for perturbation of linear programs
This page was built for publication: Error bounds for inconsistent linear inequalities and programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1342080)
