A New Infinity-Norm Path Following Algorithm for Linear Programming
From MaRDI portal
Publication:4838954
DOI10.1137/0805013zbMath0834.90084OpenAlexW2094652559MaRDI QIDQ4838954
Kurt M. Anstreicher, Robert A. Bosch
Publication date: 7 August 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0805013
interior point methodpartial updatingrank-one updatesprimal-dual path following algorithminfinity-norm centering measure
Related Items (10)
A wide neighborhood infeasible-interior-point method with arc-search for linear programming ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ Hessian distances and their applications in the complexity analysis of interior-point methods ⋮ Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path ⋮ Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path ⋮ 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
This page was built for publication: A New Infinity-Norm Path Following Algorithm for Linear Programming
