An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
From MaRDI portal
Publication:4895609
DOI10.1137/S1052623494266869zbMath0856.90073OpenAlexW2061981434MaRDI QIDQ4895609
Publication date: 23 February 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494266869
Numerical mathematical programming methods (65K05) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05)
Related Items (18)
A wide neighborhood infeasible-interior-point method with arc-search for linear programming ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming ⋮ Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ A dynamic large-update primal‐dual interior-point method for linear optimization ⋮ Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization ⋮ Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions ⋮ A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood ⋮ Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming ⋮ A primal-dual interior-point algorithm with arc-search for semidefinite programming ⋮ A new class of polynomial primal-dual methods for linear and semidefinite optimization ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
This page was built for publication: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
