Optimizing over three-dimensional subspaces in an interior-point method for linear programming
The authors discuss an enhanced version of the dual affine interior point method for linear programming. At each iterate, three search directions are considered: the dual affine direction, a rank-one correction to this direction which depends on the first constraint encountered by it, and a third-order correction term. A search is then performed to minimize the (linear) objective function on the three-dimensional manifold formed by these three search directions. A step of 99 \% of the distance to the boundary of the feasible polytope is taken. Numerical results on the netlib test set show that the algorithm runs about 20 \% faster than the authors' efficient implementation of the unadorned dual affine variant.
- 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
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- 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
- Multiple centrality corrections in a primal-dual method for linear programming
- An interior point method for general large-scale quadratic programming problems
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Extending Mehrotra's corrector for linear programs
- Dynamic Three-Dimensional Linear Programming
- LOQO:an interior point code for quadratic programming
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)
