Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
From MaRDI portal
Publication:4852579
DOI10.1137/0805027zbMATH Open0838.90081OpenAlexW2129264186MaRDI QIDQ4852579FDOQ4852579
Authors: Takashi Tsuchiya, Masakazu Muramatsu 
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
Recommendations
- A simplified global convergence proof of the affine scaling algorithm
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- Superlinear convergence of the affine scaling algorithm
interior point methodsaffine scalingdegenerate problemsglobal convergence resultslocal Karmarkar potential functions
Cited In (33)
- An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
- Shape-preserving approximation of multiscale univariate data by cubic \(L_1\) spline fits
- On the chaotic behavior of the primal-dual affine-scaling algorithm for linear optimization
- The \(\ell_1\) solution of linear inequalities
- Affine scaling algorithm fails for semidefinite programming
- Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems
- Generalized affine scaling algorithms for linear programming problems
- Trust region affine scaling algorithms for linearly constrained convex and concave programs
- Determination of an interior feasible point for a system of linear constraints
- Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm
- A first-order interior-point method for linearly constrained smooth optimization
- 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
- 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
- An affine-scaling pivot algorithm 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
- Numerical experiments with universal barrier functions for cones of Chebyshev systems
- Title not available (Why is that?)
- Shape-preserving, first-derivative-based parametric and nonparametric cubic \(L_{1}\) spline curves
- A primal-dual affine-scaling potential-reduction algorithm for linear programming
- On the big \({\mathcal M}\) in the affine scaling algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Monotone variable-metric algorithm for linearly constrained nonlinear programming
- Interior-point methods for linear programming: a review
- An alternative derivation of the projective interior point method for linear programming through the least squares approach
- An affine scaling method for solving network flow problems
This page was built for publication: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852579)
