An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
From MaRDI portal
Publication:1915917
DOI10.1007/BF02206822zbMath0848.90088MaRDI QIDQ1915917
Masakazu Muramatsu, Takashi Tsuchiya
Publication date: 24 October 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
global convergenceaffine scaling algorithminfeasible-interior-point algorithmnondegeneracy assumption
Related Items (3)
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption ⋮ Minimizing setup costs for parallel multi-purpose machines under load-balancing constraint ⋮ Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- Two-thirds is sharp for affine scaling
- A new polynomial-time algorithm for linear programming
- A combined phase I-phase II projective algorithm for linear programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- On the convergence of the affine-scaling algorithm
- A simplified global convergence proof of the affine scaling algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- A simple proof of a primal affine scaling method
- An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
- Superlinear convergence of the affine scaling algorithm
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
This page was built for publication: An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
