Limiting behavior of weighted central paths in linear programming

DOI10.1007/BF01581702zbMath0841.90089MaRDI QIDQ1338144

Osman Güler

Publication date: 29 July 1996

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

limiting behavior of control pathsweighted penalized problems

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Representing the space of linear programs as the Grassmann manifold, Coupling the proximal point algorithm with approximation methods, On the complexity of analyticity in semi-definite optimization, Calmness of partially perturbed linear systems with an application to the central path, Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights, The Convergent Generalized Central Paths for Linearly Constrained Convex Programming, A generic kernel function for interior point methods, The analyticity of interior-point-paths at strictly complementary solutions of linear programs, The asymptotic optimal partition and extensions of the nonsubstitution theorem, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Two simple proofs for analyticity of the central path in linear programming., Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, Unnamed Item, Analyticity of the central path at the boundary point in semidefinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Linear programming and the Newton barrier flow
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
• An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem
• Asymptotic convergence in a generalized predictor-corrector method
• A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Quadratic Convergence in a Primal-Dual Method
• The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• Polyhedral extensions of some theorems of linear programming
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems
• A Survey of the Implications of the Behavior of the Central Path for the Duality Theory of Linear Programming
• Complementarity Theorems for Linear Programming