Sensitivity analysis in linear programming and semidefinite programming using interior-point methods

Mathematical Programming, Series B

Volumn 90, Issue 2, 2001, Pages 229-261

  Yıldirim, E Alper ^a   Todd, Michael J ^a  

^a Cornell University   (United States)

Author keywords

Interior point methods; Linear programming; Semidefinite programming; Sensitivity analysis

Indexed keywords

EID: 0001010530     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011423     Document Type: Article

References (27)

1. Adler, I., Monteiro, R.D.C. (1991): Limiting behavior of the affine scaling continuous trajectories for linear programming problems. Math. Program. 50, 29-51
2. Adler, I., Monteiro, R.D.C. (1992): A geometric view of parametric linear programming. Algorithmica 8, 161-176
3. Alizadeh, F., Haeberly, J.-P. A., Overton, M.L. (1998): Primal-dual interior-point methods for semidefinite programming: convergence rates, stability and numerical results. SIAM J. Optim. 8, 746-768
4. Goffin, J.-L., Haurie, A., Vial, J.-P. (1992): Decomposition and nondifferentiable optimization with the projective algorithm. Manage. Sci. 38, 284-302
5. Coffin, J.-L., S.-Mokhtarian, F. (1999): Primal-dual-infeasible Newton approach for the analytic center deep-cutting plane method. J. Optimization Theory Appl. 101, 35-58
6. Goldfarb, D., Scheinberg, K. (1999): On parametric semidefinite programming. Appl. Numer. Math. 29, 361-377
7. Golub, G.H., Van Loan, C.F. (1996): Matrix Computations, Third Edition. The Johns Hopkins University Press
8. Greenberg, H.J. (1994): The use of the optimal partition in linear programming solution for post-optimal analysis. Oper. Res. Lett. 15, 179-185
9. Helmberg, C., Rendl, F., Vanderbei, R., Wolkowicz, H. (1996): An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361
10. Hoffman, A. (1952): On approximate solutions of systems of linear inequalities. J. Res. Natl. Bur. Stand. 49, 263-265
11. Holder, A.G., Sturm, J.F., Zhang, S. (1998): Analytic central path, sensitivity analysis and parametric linear programming. INFOR. To appear
12. Jansen, B., de Jong, J.J., Roos, C., Terlaky, T. (1997): Sensitivity analysis in linear programming: just be careful! Eur. J. Oper. Res. 101, 15-28
13. Kim, W.-J., Park, C.-K., Park, S. (1999): An ε-sensitivity analysis in the primal-dual interior point method. Eur. J. Oper. Res. 116, 629-639
14. Kojima, M., Shindoh, S., Hara, S. (1997): Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices. SIAM J. Optim. 7, 86-125
15. Monteiro, R.D.C. (1997): Primal-dual path following algorithms for semidefinite programming. SIAM J. Optim. 7, 663-678
16. Monteiro, R.D.C., Zanjacomo, P. (1997): A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming. Math. Program. 78, 393-396
17. Monteiro, R.D.C., Zhang, Y. (1998): A unified analysis for a class of path-following primal-dual interior-point algorithms for semidefinite programming. Math. Program. 81, 281-299
18. Nesterov, Yu.E., Todd, M.J. (1997): Self-scaled barriers and interior-point methods in convex programming. Math. Oper. Res. 22, 1-42
19. Nesterov, Yu.E., Todd, M.J. (1997): Primal-dual interior-point methods for self-scaled cones. SIAM J. Optim. 8, 324-364
20. Nunez, M.A., Freund, R.M. (1998): Condition measures and properties of the central trajectory of a linear program. Math. Program. 83, 1-28
21. Roos, C., Terlaky, T., Vial, J.-P. (1997): Theory and Algorithms for Linear Optimization: An Interior Point Approach. John Wiley & Sons, Chichester
22. Shida, M., Shindoh, S., Kojima, M. (1998): Existence and uniqueness of search directions in interior-point algorithms for the SDP and the monotone SDLCP. SIAM J. Optim. 8, 387-396.
23. Sturm, J.F., Zhang, S. (1998): On sensitivity of central solutions in semidefinite programming. Math. Program. To appear
24. Todd, M.J. (1999): A study of search directions in primal-dual interior-point methods for semidefinite programming. Optim. Methods Softw. 11, 1-46
25. Todd, M.J., Toh, K.C., Tütüncü, R.H. (1998): On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8, 769-796
26. Zhang, S. (1994): On the strictly complementary slackness relation in linear programming. In: Du, D.Z., Sun, J., eds., Advances in Optimization and Approximation, pp. 347-361. Kluwer
27. Zhang, Y. (1998): On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming. SIAM J. Optim. 8, 365-386