Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
From MaRDI portal
Publication:4022017
DOI10.1287/MOOR.17.3.527zbMATH Open0762.90053OpenAlexW2049432961MaRDI QIDQ4022017FDOQ4022017
Publication date: 17 January 1993
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3718edb2d7cede5d91720b3c087d56c6faf1636d
Cited In (30)
- Two-thirds is sharp for affine scaling
- The \(\ell_1\) solution of linear inequalities
- Global convergence of the affine scaling methods for degenerate linear programming problems
- A simplified global convergence proof of the affine scaling algorithm
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- Title not available (Why is that?)
- Generalized affine scaling algorithms for linear programming problems
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
- Degeneracy in interior point methods for linear programming: A survey
- On the symmetric affiine scaling algorithm for line programming*
- Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
- Affine scaling with degenerate linear programming problems
- A convergence analysis for a convex version of Dikin's algorithm
- The primal power affine scaling method
- Superlinear convergence of the affine scaling algorithm
- A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms
- Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming
- Loss and retention of accuracy in affine scaling methods
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
- A simple proof of a primal affine scaling method
- Analysis of some interior point continuous trajectories for convex programming
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
- A convergence proof for an affine-scaling algorithm for convex quadratic programming without nondegeneracy assumptions
- On the convergence of the affine-scaling algorithm
- A modified layered-step interior-point algorithm for linear programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Interior-point methods for linear programming: a review
- A new variant of the primal affine scaling algorithm for linear programs
Recommendations
- Global convergence of the affine scaling methods for degenerate linear programming problems π π
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems π π
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems π π
- Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming π π
- A strategy of global convergence for the affine scaling algorithm for convex semidefinite programming π π
- Affine scaling with degenerate linear programming problems π π
- A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems π π
- Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case π π
- Title not available (Why is that?) π π
- Local convergence of the affine-scaling interior-point algorithm for nonlinear programming π π
This page was built for publication: Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022017)