The primal power affine scaling method
From MaRDI portal
Publication:1915919
DOI10.1007/BF02206824zbMath0848.90090MaRDI QIDQ1915919
Publication date: 24 October 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
interior point methodsmerit functionnon-degeneracy assumptionpower barrier methodpower centerprimal affine scaling methodprimal-dual homotopy methodstwo-step superlinear convergence rate
Related Items (2)
A first-order interior-point method for linearly constrained smooth optimization ⋮ An affine scaling method for optimization problems with polyhedral constraints
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
- 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
- An implementation of Karmarkar's algorithm for linear programming
- Limiting behavior of the affine scaling continuous trajectories for linear programming problems
- A variation on Karmarkar’s algorithm for solving linear programming problems
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Efficient Acceleration Techniques for Fixed Point Algorithms
- On the generalized path-following methods for linear programming
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Inverse barrier methods for linear programming
- Some Efficient Algorithms for Solving Systems of Nonlinear Equations
This page was built for publication: The primal power affine scaling method
