Warm-start strategies in interior-point methods for linear programming

SIAM Journal on Optimization

Volumn 12, Issue 3, 2002, Pages 782-810

  Yildirim, E Alper ^a   Wright, Stephen J ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

Interior point methods; Linear programming; Reoptimizatiou; Warm start

Indexed keywords

EID: 0036354771     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623400369235     Document Type: Article

References (18)

1. Stability conditions for linear programming problems
2. On the speed of an iterative process
3. On linear least-squares problems with diagonally dominant weight matrices
4. A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"
5. Warm start of the primal-dual method applied in the cutting-plane scheme
6. Warm start and epsilon-subgradients in the cutting plane scheme for block-angular linear programs
7. Solving real-world linear ordering problems using a primaldual interior point cutting plane method
8. Solving combinatorial optimization problems using Kar-markar's algorithm
9. Condition measures and properties of the central trajectory of a linear program
10. Some perturbation theory for linear programming
11. Incorporating condition measures into the complexity theory of linear programming
12. Linear programming, complexity theory, and elementary functional analysis
13. Condition numbers, the barrier method, and the conjugate-gradient method
14. A characterization of stability in linear programming
15. Primal-Dual Interior-Point Methods
16. An interior-point approach to sensitivity analysis in degenerate linear programs
17. Sensitivity analysis in linear programming and semidefinite programming using interior-point methods