Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
From MaRDI portal
Publication:4852579
DOI10.1137/0805027zbMath0838.90081OpenAlexW2129264186MaRDI QIDQ4852579
Masakazu Muramatsu, Takashi Tsuchiya
Publication date: 1 November 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/9270b33936eee24fbe7a064236d5c15ba4f55013
interior point methodsdegenerate problemsaffine scalingglobal convergence resultslocal Karmarkar potential functions
Related Items (30)
Superlinear convergence of the affine scaling algorithm ⋮ Unnamed Item ⋮ Shape-preserving approximation of multiscale univariate data by cubic \(L_1\) spline fits ⋮ Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case ⋮ A simple proof of a primal affine scaling method ⋮ An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption ⋮ A convergence analysis for a convex version of Dikin's algorithm ⋮ The primal power affine scaling method ⋮ An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming ⋮ Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm ⋮ Trust region affine scaling algorithms for linearly constrained convex and concave programs ⋮ On the chaotic behavior of the primal–dual affine–scaling algorithm for linear optimization ⋮ Affine scaling with degenerate linear programming problems ⋮ An affine scaling method for solving network flow problems ⋮ The \(\ell_1\) solution of linear inequalities ⋮ A first-order interior-point method for linearly constrained smooth optimization ⋮ Shape-preserving, first-derivative-based parametric and nonparametric cubic \(L_{1}\) spline curves ⋮ Loss and retention of accuracy in affine scaling methods ⋮ Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization ⋮ Numerical experiments with universal barrier functions for cones of Chebyshev systems ⋮ Determination of an interior feasible point for a system of linear constraints ⋮ An affine-scaling pivot algorithm for linear programming ⋮ Affine scaling algorithm fails for semidefinite programming ⋮ Monotone variable-metric algorithm for linearly constrained nonlinear programming ⋮ Generalized affine scaling algorithms for linear programming problems ⋮ Degeneracy in interior point methods for linear programming: A survey ⋮ An alternative derivation of the projective interior point method for linear programming through the least squares approach ⋮ On the big \({\mathcal M}\) in the affine scaling algorithm ⋮ A primal-dual affine-scaling potential-reduction algorithm for linear programming ⋮ Interior-point methods for linear programming: a review
This page was built for publication: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
