A new variant of the primal affine scaling algorithm for linear programs

DOI10.1080/02331939108843712zbMATH Open0742.90054OpenAlexW2032418981MaRDI QIDQ3979522FDOQ3979522

Authors: Gwo-Ming Jan, Shu-Cherng Fang 

Publication date: 26 June 1992

Published in: Optimization (Search for Journal in Brave)

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

Recommendations

• A class of primal affine scaling algorithms
• A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• A simple proof of a primal affine scaling method
• Convergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case
• A primal null-space affine-scaling method
• Constant potential primal-dual algorithms: A framework
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
• scientific article; zbMATH DE number 4197742

zbMATH Keywords

primal affine scaling algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• La méthode des centres dans un espace topologique
• Title not available (Why is that?)
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A modification of Karmarkar's linear programming algorithm
• An experimental approach to karmarkar’s projective method for linear programming

Cited In (11)

• An affine scaling method using a class of differential barrier functions: primal approach
• Superlinear primal-dual affine scaling algorithms for LCP
• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• Generating interior search directions for multiobjective linear programming using approximate gradients and efficient anchoring points
• Title not available (Why is that?)
• A class of primal affine scaling algorithms
• Improved complexity using higher-order correctors for primal-dual Dikin affine scaling
• A circular cone relaxation primal interior point algorithm for LP
• A quadratically convergent global algorithm for the linearly-constrained minimum cross-entropy problem
• A primal-dual affine-scaling potential-reduction algorithm for linear programming
• Polynomial primal-dual cone affine scaling for semidefinite programming

This page was built for publication: A new variant of the primal affine scaling algorithm for linear programs

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