Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
From MaRDI portal
Publication:1290596
DOI10.1007/BF01584841zbMath0949.90060DBLPjournals/mp/ToddY98OpenAlexW1988287493WikidataQ92422326 ScholiaQ92422326MaRDI QIDQ1290596
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584841
Linear programming (90C05) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)
Related Items (5)
Initialization in semidefinite programming via a self-dual skew-symmetric embedding ⋮ Preprocessing and Regularization for Degenerate Semidefinite Programs ⋮ The complexity of self-regular proximity based infeasible IPMs ⋮ New stopping criteria for detecting infeasibility in conic optimization ⋮ A semidefinite relaxation algorithm for checking completely positive separable matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- On \(\ell_ p\) programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- Finding an interior point in the optimal face of linear programs
- On minimum norm solutions
- Some perturbation theory for linear programming
- Polynomiality of infeasible-interior-point algorithms for linear programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Potential-reduction methods in mathematical programming
- A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
- Bounds for error in the solution set of a perturbed linear program
- On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
- Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
- Path-Following Methods for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Approximations to Solutions to Systems of Linear Inequalities
- An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
This page was built for publication: Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
