Optimizing over three-dimensional subspaces in an interior-point method for linear programming

DOI10.1016/0024-3795(91)90280-AMaRDI QIDQ808189zbMATH OpenWikidataFDO

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)

Full work available at URL https://doi.org/10.1016/0024-3795(91)90280-A

zbMATH Keywords

linear programmingalgorithmNumerical resultsdual affine directiondual affine interior point methodnetlib test setrank-one correctionthird-order correctionthree-dimensional subspaces

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Recommendations

• Extending Mehrotra's corrector for linear programs
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• An interior point method for linear programming
• Insights into the interior-point methods
• scientific article; zbMATH DE number 4197738

Cites work

• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• scientific article; zbMATH DE number 3793774 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An implementation of Karmarkar's algorithm for linear programming
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Computing Karmarkar projections quickly
• Feasibility issues in a primal-dual interior-point method for linear programming
• Further Development of a Primal-Dual Interior Point Method
• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
• Karmarkar's linear programming algorithm and Newton's method
• Power Series Variants of Karmarkar-Type Algorithms
• Symbolic analysis of analog and digital circuits
• 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
• 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

Cited in

(6)

• LOQO:an interior point code for quadratic programming
• Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
• Multiple centrality corrections in a primal-dual method for linear programming
• Extending Mehrotra's corrector for linear programs
• Dynamic Three-Dimensional Linear Programming
• An interior point method for general large-scale quadratic programming problems

Describes a project that uses

Uses Software

• XMP
• MINOS

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)