Computational experience with a modified potential reduction algorithm for linear programming
From MaRDI portal
Publication:5200565
DOI10.1080/10556788.2011.634911zbMath1260.90123OpenAlexW2042444152MaRDI QIDQ5200565
Sanjay Mehrotra, Kuo-Ling Huang
Publication date: 6 November 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2011.634911
Numerical mathematical programming methods (65K05) Linear programming (90C05) Interior-point methods (90C51) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (3)
A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ An empirical evaluation of walk-and-round heuristics for mixed integer linear programs ⋮ An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
Uses Software
Cites Work
- A new polynomial-time algorithm for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A primal-dual infeasible-interior-point algorithm for linear programming
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Long-step strategies in interior-point primal-dual methods
- Multiple centrality corrections in a primal-dual method for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An infeasible-interior-point potential-reduction algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- On the Implementation of a Primal-Dual Interior Point Method
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- PCx: an interior-point code for linear programming
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Symmetric Quasidefinite Matrices
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
This page was built for publication: Computational experience with a modified potential reduction algorithm for linear programming
