Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
type: Item
instance of: scholarly article
title: Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
zbMATH Open document ID: 0949.90060
DOI: 10.1007/BF01584841
author: Yinyu Ye
author: Michael J. Todd
published in: Mathematical Programming. Series A. Series B
publication date: 1999-06-28T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 46N10
zbMATH DE Number: 1294652
zbMATH Keywords: linear programming
zbMATH Keywords: Farkas lemma
zbMATH Keywords: infeasible-interior-point methods
zbMATH Keywords: stopping rules
MaRDI profile type: Publication
cites work: A new polynomial-time algorithm for linear programming
cites work: Q3818127
cites work: Path-Following Methods for Linear Programming
cites work: Q4296156
cites work: Potential-reduction methods in mathematical programming
cites work: Finding an interior point in the optimal face of linear programs
cites work: A primal-dual interior point method whose running time depends only on the constraint matrix
cites work: Bounds for error in the solution set of a perturbed linear program
cites work: Q4742548
cites work: Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
cites work: Some perturbation theory for linear programming
cites work: On minimum norm solutions
cites work: Q3696875
cites work: A primal-dual infeasible-interior-point algorithm for linear programming
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: Computational experience with a primal-dual interior point method for linear programming
cites work: Polynomiality of infeasible-interior-point algorithms for linear programming
cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
cites work: An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
cites work: Approximations to Solutions to Systems of Linear Inequalities
cites work: On \(\ell_ p\) programming
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Convergence behavior of interior-point algorithms
cites work: A simplified homogeneous and self-dual linear programming algorithm and its implementation
cites work: Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
cites work: On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
Wikidata QID: Q92422326
full work available at URL: https://doi.org/10.1007/bf01584841
OpenAlex ID: W1988287493
DBLP publication ID: journals/mp/ToddY98
description: scientific article; zbMATH DE number 1294652