Condition measures and properties of the central trajectory of a linear program

DOI10.1007/BF02680548zbMath0920.90097OpenAlexW2045419427MaRDI QIDQ1290648

Robert M. Freund, Manuel A. Nunez

Publication date: 3 June 1999

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

Full work available at URL: https://doi.org/10.1007/bf02680548

zbMATH Keywords

perturbation theoryapproximate solutionsinterior-point methodsanalytic centerdistance to ill-posednesscentral trajectoryapproximate datacondition measures

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

A decomposition-based crash-start for stochastic programming, An interior-exterior approach for convex quadratic programming, A new warmstarting strategy for the primal-dual column generation method, On the block-structured distance to non-surjectivity of sublinear mappings, Solving linear programs with finite precision. II: Algorithms, Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems, A Data-Independent Distance to Infeasibility for Linear Conic Systems, A hybrid branch-and-bound approach for exact rational mixed-integer programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stable theorem of the alternative: An extension of the Gordan theorem
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Some perturbation theory for linear programming
• On the complexity of solving feasible systems of linear inequalities specified with approximate data
• Linear programming, complexity theory and elementary functional analysis
• Limiting behavior of the affine scaling continuous trajectories for linear programming problems
• Stability conditions for linear programming problems
• Path-Following Methods for Linear Programming
• Stability Theory for Systems of Inequalities. Part I: Linear Systems
• Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
• A Characterization of Stability in Linear Programming
• On the Complexity of Solving Sparse Symmetric Linear Programs Specified with Approximate Data
• Condition Numbers, the Barrier Method, and the Conjugate-Gradient Method
• Incorporating Condition Measures into the Complexity Theory of Linear Programming
• Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
• Convex Programming and Duality in Normed Space
• Complementarity Theorems for Linear Programming