On the symmetric affiine scaling algorithm for line programming*

DOI10.1080/02331939508844043zbMath0821.90080OpenAlexW1984677330MaRDI QIDQ4764582

No author found.

Publication date: 4 May 1995

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844043

zbMATH Keywords

interior point algorithmfirst order approximationcentral trajectoryprimal-dual feasible solution

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A polynomial Newton method for linear programming
• A relaxed version of Karmarkar's method
• Global convergence of the affine scaling methods for degenerate linear programming problems
• Superlinear convergence of the affine scaling algorithm
• 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
• A variant of Karmarkar's linear programming algorithm for problems in standard form
• Numerical experiments with the symmetric affine scaling algorithm on degenerate linear programming problema
• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems

This page was built for publication: On the symmetric affiine scaling algorithm for line programming^*