Deriving an unconstrained convex program for linear programming
Authors:
- 1 December 1992
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 75 (3) , 603-612
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Insights into the interior-point methodsMathematical Methods of Operations Research, 1992
- An unconstrained convex programming view of linear programmingMathematical Methods of Operations Research, 1992
- On the convex programming approach to linear programmingOperations Research Letters, 1991
- Quadratically constrained minimum cross-entropy analysisMathematical Programming, 1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- Entropy in linear programsMathematical Programming, 1981
- Geometric ProgrammingSIAM Review, 1976