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

DOI10.1007/BF02680548MaRDI QIDQ1290648zbMATH OpenOpenAlexFDO

Authors Manuel Núñez, Robert M. Freund

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, http://hdl.handle.net/1721.1/2612

zbMATH Keywords

analytic centerapproximate dataapproximate solutionscentral trajectorycondition measuresdistance to ill-posednessinterior-point methodsperturbation theory

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
• Solving linear programs with finite precision. I: Condition numbers and random programs
• A new condition number for linear programming
• Unifying Condition Numbers for Linear Programming

Cites work

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

Cited in

(9)

• Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
• A decomposition-based crash-start for stochastic programming
• On the block-structured distance to non-surjectivity of sublinear mappings
• Solving linear programs with finite precision. II: Algorithms
• Condition-measure bounds on the behavior of the central trajectory of a semidefinite program
• An interior-exterior approach for convex quadratic programming
• A new warmstarting strategy for the primal-dual column generation method
• A data-independent distance to infeasibility for linear conic systems
• A hybrid branch-and-bound approach for exact rational mixed-integer programming

This page was built for publication: Condition measures and properties of the central trajectory of a linear program

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