Keywords
Simplex algorithmLinear programmingIterated functionInterior point methodMathematicsSequence (biology)Mathematical optimizationAlgorithmBounded functionDual (grammatical number)Norm (philosophy)Convergence (economics)Criss-cross algorithmSimplexComputer scienceLinear-fractional programming
Affiliated Institutions
Related Publications
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming pr...
On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
In the adaptive step primal-dual interior point method for linear programming, polynomial algorithms are obtained by computing Newton directions towards targets on the central p...
Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
A survey of the significant developments in the field of interior point methods for linear programming is presented, beginning with Karmarkar's projective algorithm and concentr...
Fortified-Descent Simplicial Search Method: A General Approach
We propose a new simplex-based direct search method for unconstrained minimization of a real-valued function f of n variables. As in other methods of this kind, the intent is to...
A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
An exact-penalty-function-based scheme---inspired from an old idea due to Mayne and Polak [Math. Program., 11 (1976), pp.67--80]---is proposed for extending to general smooth co...
Publication Info
- Year
- 1998
- Type
- article
- Volume
- 81
- Issue
- 1
- Pages
- 1-21
- Citations
- 20
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
20
OpenAlex
Cite This
Michael J. Todd,
Yinyu Ye
(1998).
Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming.
Mathematical Programming
, 81
(1)
, 1-21.
https://doi.org/10.1007/bf01584841
Identifiers
- DOI
- 10.1007/bf01584841