Finding an interior point in the optimal face of linear programs
- 1 February 1993
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 62 (1), 497-515
- https://doi.org/10.1007/bf01585180
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Quadratic Convergence in a Primal-Dual MethodMathematics of Operations Research, 1993
- Convergence behavior of interior-point algorithmsMathematical Programming, 1993
- Solving symmetric indefinite systems in an interior-point method for linear programmingMathematical Programming, 1993
- Implementing the Simplex Method: The Initial BasisINFORMS Journal on Computing, 1992
- A Low Complexity Interior-Point Algorithm for Linear ProgrammingSIAM Journal on Optimization, 1992
- On Finding Primal- and Dual-Optimal BasesINFORMS Journal on Computing, 1991
- Interior path following primal-dual algorithms. part I: Linear programmingMathematical Programming, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear ProgramsOperations Research, 1986