Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension

Computational Optimization and Applications

Volumn 41, Issue 2, 2008, Pages 151-183

  John, Elizabeth ^a   Yıldırım, E Alper ^b  

^a Automatic Data Processing Inc   (United States)

^b BILKENT UNIVERSITY   (Turkey)

Author keywords

Interior point methods; Linear programming; Reoptimization; Warm start strategies

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION;

COMPUTATION TIME; COMPUTATIONAL RESULTS; DIFFERENT SIZES; INTERIOR-POINT METHOD; NUMBER OF ITERATIONS; REOPTIMIZATION; STATE OF THE ART; WARM START;

LINEAR PROGRAMMING;

EID: 53349107717     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9096-y     Document Type: Article

References (34)

1. E.D. Andersen K.D. Andersen 1995 Presolving in linear programming Math. Program. 71 2 221 245
2. H.Y. Benson D.F. Shanno 2007 An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming Comput. Optim. Appl. 10.1007/s10589-007-9048-6 in press
3. H.Y. Benson D.F. Shanno 2007 Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts Comput. Optim. Appl. 10.1007/s10589-007-9089-x in press
4. A.R. Curtis J.K. Reid 1972 On the automatic scaling of matrices for Gaussian elimination J. Inst. Math. Appl. 10 118 124
5. J. Czyzyk S. Mehrotra M. Wagner S.J. Wright 1999 PCx: An interior-point code for linear programming Optim. Methods Softw. 11-2 1-4 397 430
6. S. Elhedhli J.L. Goffin 2004 The integration of an interior-point cutting plane method within a branch-and-price algorithm Math. Program. 100 2 267 294
7. J. Fliege 2006 An efficient interior-point method for convex multicriteria optimization problems Math. Oper. Res. 31 825 845
8. Fliege, J., Heseler, A.: Constructing approximations to the efficient set of convex quadratic multiobjective problems. Technical report, Dortmund University, Dortmund, Germany (2002)
9. Forsgren, A.: On warmstarts for interior methods. In: Ceragioli, F., Dontchev, A., Furuta, H., Marti, K., Pandolfi, L. (eds.) System Modeling and Optimization. IFIP International Federation for Information Processing, vol. 199, pp. 51-66. Springer, Boston (2006)
10. R.M. Freund 1991 A potential function reduction algorithm for solving a linear program directly from an infeasible "warm start" Math. Program. 52 441 466
11. R.M. Freund 1991 Theoretical efficiency of a shifted-barrier-function algorithm for linear programming Linear Algebra Appl. 152 1 19 41
12. J.-L. Goffin A. Haurie J.-P. Vial 1992 Decomposition and nondifferentiable optimization with the projective algorithm Manag. Sci. 38 284 302
13. J.L. Goffin J.P. Vial 2002 Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method Optim. Methods Softw. 17 5 805 867
14. J. Gondzio 1996 Multiple centrality corrections in a primal-dual method for linear programming Comput. Optim. Appl. 6 137 156
15. J. Gondzio 1998 Warm start of the primal-dual method applied in the cutting-plane scheme Math. Program. 83 125 143
16. J. Gondzio A. Grothey 2003 Re-optimization with the primal-dual interior point method SIAM J. Optim. 13 3 842 864
17. J. Gondzio J.-Ph. Vial 1999 Warm start and epsilon-subgradients in the cutting plane scheme for block-angular linear programs Comput. Optim. Appl. 14 1 17 36
18. John, E.: Implementation of warm-start strategies in interior-point methods for linear programming. PhD thesis, Department of Applied Mathematics and Statistics, Stony Brook University (2005)
19. N. Karmarkar 1984 A new polynomial-time algorithm for linear programming Combinatorica 4 373 395
20. I.J. Lustig R.E. Marsten D.F. Shanno 1994 Interior point methods for linear programming: Computational state of the art ORSA J. Comput. 6 1 14
21. S. Mehrotra 1992 On the implementation of a primal-dual interior point method SIAM J. Optim. 2 575 601
22. J.E. Mitchell 2000 Computational experience with an interior-point cutting plane algorithm SIAM J. Optim. 10 4 1212 1227
23. J.E. Mitchell B. Borchers 1996 Solving real-world linear ordering problems using a primal-dual interior point cutting plane method Ann. Oper. Res. 62 253 276
24. J.E. Mitchell M.J. Todd 1992 Solving combinatorial optimization problems using Karmarkar's algorithm Math. Program. 56 245 284
25. Nesterov, Y.E., Nemirovskii, A.S.: Interior Point Polynomial Methods in Convex Programming. SIAM, Philadelphia (1994)
26. E. Ng B.W. Peyton 1993 Block sparse Cholesky algorithms on advanced uniprocessor computers SIAM J. Sci. Comput. 14 1034 1056
27. R. Polyak 1992 Modified barrier functions (theory and methods) Math. Program. 54 177 222
28. Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MPS/SIAM Series on Optimization, vol. 3. SIAM, Philadelphia (2001)
29. Todd, M.J.: Detecting infeasibility in infeasible-interior-point methods for optimization. In: Cucker, F., De Vore, R., Olver, P. (eds.) Foundations of Computational Mathematics, pp. 157-192. Cambridge University Press, Cambridge (2004)
30. Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)
31. E.A. YIldIrIm 2003 An interior-point perspective on sensitivity analysis in semidefinite programming Math. Oper. Res. 28 4 649 676
32. E.A. YIldIrIm M.J. Todd 2001 Sensitivity analysis in linear programming and semidefinite programming using interior-point methods Math. Program. 90 2 229 261
33. E.A. YIldIrIm M.J. Todd 2002 An interior-point approach to sensitivity analysis in degenerate linear programs SIAM J. Optim. 12 3 692 714
34. E.A. YIldIrIm S.J. Wright 2002 Warm-start strategies in interior-point methods for linear programming SIAM J. Optim. 12 3 782 810