Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- 1 July 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 19-41
- https://doi.org/10.1016/0024-3795(91)90265-x
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Projective transformations for interior-point algorithms, and a superlinearly convergent algorithm for the w-center problemMathematical Programming, 1993
- A Method for the Parametric Center Problem, with a Strictly Monotone Polynomial-Time Algorithm for Linear ProgrammingMathematics of Operations Research, 1991
- Conical projection algorithms for linear programmingMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- Optimization of “$\log x$” Entropy over Linear Equality ConstraintsSIAM Journal on Control and Optimization, 1987
- A variant of Karmarkar's linear programming algorithm for problems in standard formMathematical Programming, 1987
- A monotonic projective algorithm for fractional linear programmingAlgorithmica, 1986