Computational experience with a modified potential reduction algorithm for linear programming

DOI10.1080/10556788.2011.634911MaRDI QIDQ5200565zbMATH OpenOpenAlexFDO

Authors Sanjay Mehrotra, Kuo-Ling Huang

Publication date 6 November 2012

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2011.634911

zbMATH Keywords

linear programminginterior point methodshomogeneous and self-dual model

Mathematics Subject Classification ID

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)

Recommendations

• An infeasible-interior-point potential-reduction algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• scientific article; zbMATH DE number 4197744
• A simplified homogeneous and self-dual linear programming algorithm and its implementation
• Potential-reduction methods in mathematical programming

Cites work

• A Centered Projective Algorithm for Linear Programming
• A new polynomial-time algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• A simplified homogeneous and self-dual linear programming algorithm and its implementation
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• An infeasible-interior-point potential-reduction algorithm for linear programming
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• Long-step strategies in interior-point primal-dual methods
• Multiple centrality corrections in a primal-dual method for linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Implementation of a Primal-Dual Interior Point Method
• PCx: an interior-point code for linear programming
• Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
• Solving symmetric indefinite systems in an interior-point method for linear programming
• Symmetric Quasidefinite Matrices

Cited in

(5)

• Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs
• A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem

Describes a project that uses

Uses Software

• MA47
• PCx
• Mosek
• CPLEX

This page was built for publication: Computational experience with a modified potential reduction algorithm for linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200565)