An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption

DOI10.1007/BF02206822MaRDI QIDQ1915917zbMATH OpenFDO

Authors Masakazu Muramatsu, Takashi Tsuchiya

Publication date 24 October 1996

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

global convergenceaffine scaling algorithminfeasible-interior-point algorithmnondegeneracy assumption

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
• Global convergence of the affine scaling methods for degenerate linear programming problems
• scientific article; zbMATH DE number 4195696
• On the convergence of the affine-scaling algorithm
• A simplified global convergence proof of the affine scaling algorithm

Cites work

• scientific article; zbMATH DE number 3625108 (Why is no real title available?)
• scientific article; zbMATH DE number 3800875 (Why is no real title available?)
• scientific article; zbMATH DE number 3301975 (Why is no real title available?)
• A combined phase I-phase II projective algorithm for linear programming
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• A simple proof of a primal affine scaling method
• A simplified global convergence proof of the affine scaling algorithm
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
• An implementation of Karmarkar's algorithm for linear programming
• 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
• Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
• Global convergence of the affine scaling methods for degenerate linear programming problems
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• On the convergence of the affine-scaling algorithm
• Superlinear convergence of the affine scaling algorithm
• Two-thirds is sharp for affine scaling

Cited in

(4)

• 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
• Partial Affine-Scaling for Linearly Constrained Minimization
• Convergence properties of Dikin's affine scaling algorithm for nonconvex quadratic minimization

This page was built for publication: An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1915917)