Optimizing over three-dimensional subspaces in an interior-point method for linear programming
- 1 July 1991
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 152, 315-342
- https://doi.org/10.1016/0024-3795(91)90280-a
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Algorithmic Enhancements to the Method of Centers for Linear Programming ProblemsINFORMS Journal on Computing, 1989
- Power Series Variants of Karmarkar-Type AlgorithmsAT&T Technical Journal, 1989
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- An implementation of Karmarkar's algorithm for linear programmingMathematical Programming, 1989
- Boundary Behavior of Interior Point Algorithms in Linear ProgrammingMathematics of Operations Research, 1989
- Computational experience with a dual affine variant of Karmarkar's method for linear programmingOperations Research Letters, 1987
- The polyadic structure of factorable function tensors with applications to high-order minimization techniquesJournal of Optimization Theory and Applications, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- The Design of the XMP Linear Programming LibraryACM Transactions on Mathematical Software, 1981
- Analysis of mathematical programming problems prior to applying the simplex algorithmMathematical Programming, 1975