Optimizing over three-dimensional subspaces in an interior-point method for linear programming
DOI10.1016/0024-3795(91)90280-AzbMATH Open0731.65051WikidataQ114852071 ScholiaQ114852071MaRDI QIDQ808189FDOQ808189
Authors: Paul D. Domich, Paul T. Boggs, Janet E. Rogers, Christoph Witzgall 
Publication date: 1991
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Recommendations
linear programmingalgorithmNumerical resultsdual affine directiondual affine interior point methodnetlib test setrank-one correctionthird-order correctionthree-dimensional subspaces
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A polynomial-time algorithm, based on Newton's method, for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Computational experience with a primal-dual interior point method for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
- The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
- Title not available (Why is that?)
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
- The polyadic structure of factorable function tensors with applications to high-order minimization techniques
- Computing Karmarkar projections quickly
- Karmarkar's linear programming algorithm and Newton's method
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Symbolic analysis of analog and digital circuits
- Power Series Variants of Karmarkar-Type Algorithms
Cited In (6)
- LOQO:an interior point code for quadratic programming
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Extending Mehrotra's corrector for linear programs
- Multiple centrality corrections in a primal-dual method for linear programming
- Dynamic Three-Dimensional Linear Programming
- An interior point method for general large-scale quadratic programming problems
Uses Software
This page was built for publication: Optimizing over three-dimensional subspaces in an interior-point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808189)
