A study of the dual affine scaling continuous trajectories for linear programming

DOI10.1007/s10957-013-0495-1zbMath1330.90052OpenAlexW2054955634MaRDI QIDQ481775

Li-Zhi Liao

Publication date: 15 December 2014

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-013-0495-1

zbMATH Keywords

semidefinite programmingpolynomial complexityinexact search directioninfeasible central path, infeasible interior point methodsemidefinite least squares

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Related Items (6)

Analysis of some interior point continuous trajectories for convex programming ⋮ A fast continuous method for the extreme eigenvalue problem ⋮ Primal-Dual Path-Following Methods and the Trust-Region Updating Strategy for Linear Programming with Noisy Data ⋮ A continuous method model for solving general variational inequality ⋮ The Convergent Generalized Central Paths for Linearly Constrained Convex Programming ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• On scaled projections and pseudoinverses
• Interior point algorithms for linear programming with inequality constraints
• A survey of search directions in interior point methods for linear programming
• On the convergence of the affine-scaling algorithm
• Neurodynamical optimization
• Continuous methods for extreme and interior eigenvalue problems
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Convergence and Boundary Behavior of the Projective Scaling Trajectories for Linear Programming
• A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm
• Dynamical System Characterization of the Central Path and Its Variants—A Revisit
• Convergence of the Iterates of Descent Methods for Analytic Cost Functions

This page was built for publication: A study of the dual affine scaling continuous trajectories for linear programming