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

DOI10.1016/0024-3795(91)90280-AzbMath0731.65051WikidataQ114852071 ScholiaQ114852071MaRDI QIDQ808189

Paul D. Domich, Janet E. Rogers, Paul T. Boggs, Christoph Witzgall

Publication date: 1991

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmlinear programmingNumerical 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)

Related Items (4)

Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming ⋮ An interior point method for general large-scale quadratic programming problems ⋮ Multiple centrality corrections in a primal-dual method for linear programming ⋮ LOQO:an interior point code for quadratic programming

Uses Software

• MINOS
• XMP

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• The polyadic structure of factorable function tensors with applications to high-order minimization techniques
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Computing Karmarkar projections quickly
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Karmarkar's linear programming algorithm and Newton's method
• An implementation of Karmarkar's algorithm for linear programming
• The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry
• 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
• Boundary Behavior of Interior Point Algorithms in 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
• 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
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Symbolic analysis of analog and digital circuits
• Power Series Variants of Karmarkar-Type Algorithms

This page was built for publication: Optimizing over three-dimensional subspaces in an interior-point method for linear programming