Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

DOI10.1137/0805003zbMath0832.90076OpenAlexW2093180021MaRDI QIDQ4764308

Michael J. Todd, Kojima, Masakazu, Shinji Mizuno

Publication date: 30 May 1995

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/8908

zbMATH Keywords

infeasible interior point primal-dual potential-reduction algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (27)

Global convergence in infeasible-interior-point algorithms ⋮ An Infeasible Mizuno–Todd–Ye Type Algorithm for Convex Quadratic Programming with Polynomial Complexity ⋮ An infeasible-interior-point algorithm for linear complementarity problems ⋮ A predictor-corrector infeasible-interior-point algorithm for linear programming ⋮ A still simpler way of introducing interior-point method for linear programming ⋮ Starting-point strategies for an infeasible potential reduction method ⋮ On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem ⋮ Stopping criteria for inner iterations in inexact potential reduction methods: a computational study ⋮ Potential-reduction methods in mathematical programming ⋮ An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems ⋮ Linear programming with stochastic elements: An on-line approach ⋮ A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems ⋮ Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs ⋮ An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution ⋮ An infeasible-interior-point algorithm using projections onto a convex set ⋮ An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence ⋮ Solving real-world linear ordering problems using a primal-dual interior point cutting plane method ⋮ Deriving potential functions via a symmetry principle for nonlinear equations ⋮ Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs ⋮ A potential-reduction algorithm for linear complementarity problems ⋮ Convergence analysis of an inexact potential reduction method for convex quadratic programming ⋮ Computational experience with a modified potential reduction algorithm for linear programming ⋮ A Class of Infeasible Interior Point Algorithms for Convex Quadratic Programming ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ Interior-point methods for linear programming: a review

This page was built for publication: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming