On effectively computing the analytic center of the solution set by primal-dual interior-point methods

SIAM Journal on Optimization

Volumn 8, Issue 1, 1998, Pages 1-25

  González Lima, María D ^a   Tapia, Richard A ^b   Potra, Florian A ^c  

^a UNIVERSIDAD SIMÓN BOLÍVAR   (Venezuela)

^b RICE UNIVERSITY   (United States)

^c University of Iowa   (United States)

Author keywords

Analytic center solution; Linear programming; Primal dual interior point algorithm

Indexed keywords

EID: 0040676635     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623495291793     Document Type: Article

References (26)

1. J. F. BONNANS AND C. C. GONZAGA, Convergence of interior point algorithms for the monotone linear complementarity problem, Math. Oper. Res., 21 (1996), pp. 1-25.
2. J. F. BONNANS AND F. A. POTRA, Unfeasible path following algorithms for linear complimentary problems, Math Oper. Res., to appear.
3. A. CHARNES, W. W. COOPER, AND R. M. THRALL, A structure for classifying and characterizing efficiency and inefficiency in data envelopment analysis, J. Productivity Anal., 2 (1991), pp. 197-237.
4. J. E. DENNIS AND R. B. SCHNABEL, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, Englewood Cliffs, NJ, 1983.
5. A. EL-BAKRY, R. A. TAPIA, T. TSUCHIYA, AND Y. ZHANG, On the formulation of the primaldual Newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-542.
6. A. EL-BAKRY, R. A. TAPIA, AND Y. ZHANG, A study of indicators for identifying zero variables in interior-point methods, SIAM Rev., 36 (1994), pp. 45-72.
7. C. C. GONZAGA, Path-following methods for linear programming, SIAM Rev., 34 (1992), pp. 167-224.
8. C. C. GONZAGA AND R. A. TAPIA, On the convergence of the Mizuno-Todd-Ye algorithm to the analytic center of the solution set, SIAM J. Optim., 7 (1997), pp. 47-65.
9. M. D. GONZALEZ-LIMA, Effective Computation of the Analytic Center of the Solution Set in Linear Programming Using Primal-Dual Interior-Point Methods, Technical report TR94-48, Rice University, Dept. of Computational and Applied Mathematics, Houston, TX, 1994.
10. O. GÜLER AND Y. YE, Convergence behavior of some interior-point algorithms, Math. Programming, 60 (1993), pp. 215-228.
11. M. KOJIMA, S. MIZUNO, AND A. YOSHISE, A primal-dual interior point method for linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 29-47.
12. I. LUSTIG, R. MARSTEN, AND D. SHANNO, On implementing Mehrotra's predictor-corrector interior-point method for linear programming, SIAM J. Optim., 2 (1992), pp. 435-449.
13. L. MCLINDEN, An analogue of Moreau's approximation theorem, with application to the non-linear complementarity problem, Pacific J. Math., 88 (1980), pp. 101-161.
14. K. MCSHANE, A superlinearly convergent O(√nL)-iteration interior point algorithms for linear programming and the monotone linear complementarity problem, SIAM J. Optim., 4 (1994), pp. 247-261.
15. N. MEGIDDO, Pathways to the optimal set in linear programming, in Progress in Mathematical Programming, Interior-Point and Related Methods, N. Megiddo, ed., Springer-Verlag, New York, 1989, pp. 131-158.
16. S. MIZUNO, M. J. TODD, AND Y. YE, On adaptive-step primal-dual interior-point algorithms for linear programming, Math. Oper. Res., 18 (1993), pp. 964-981.
17. G. SONNEVEND, "An analytical centre" for polyhedrons and new classes for linear (smooth, convex) programming, in System Modelling and Optimization (Budapest, 1985), Lecture Notes in Control and Inform. Sci. 84, A. Prekopa, J. Szelezsan, and B. Strazicky, eds., Springer-Verlag, New York, 1985, pp. 866-876.
18. R. A. TAPIA, Y. ZHANG, AND Y. YE, On the convergence of the iteration sequence in primaldual interior-point methods, Math. Programming, 68 (1995), pp. 141-154.
19. R. THOMPSON, P. S. DHARMAPALA, AND R. M. THRALL, DEA sensitivity analysis of efficiency measures with an application to Kansas farming and Illinois coal mining, in Data Envelopment Analysis: Theory, Methodology and Applications, A. Charnes, W. W. Cooper, A. Y. Lewin, and L. M. Seiford, eds., Kluwer, Boston, MA, 1994, pp. 293-422.
20. Y. YE. O. GÜLER, R. A. TAPIA, AND Y. ZHANG, A quadratically convergent O(√nL)-iteration algorithm for linear programming, Math. Programming, 59 (1993), pp. 151-162.
21. Y. YE, R. A. TAPIA, AND Y. ZHANG, A Superlinearly Convergent O(√nL)-Iteration Algorithm for Linear Programming, Technical report TR91-22, Dept. Mathematical Sciences, Rice University, Houston, TX, 1991.
22. Y. ZHANG AND A. EL-BAKRY, A modified predictor-corrector algorithm for locating weighted centers in linear programming, J. Optim. Theory Appl., 80 (1994), pp. 319-331.
23. Y. ZHANG AND R. A. TAPIA, Superlinear and quadratic convergence of primal-dual interior point methods for linear programming revisited, J. Optim. Theory Appl., 73 (1992), pp. 229-242.
24. Y. ZHANG AND R. A. TAPIA, On the Convergence of Interior-Point Methods to the Center of Solution Set in Linear Programming, Technical report TR91-30, Dept. Mathematical Sciences, Rice University, Houston, TX, 1991.
25. Y. ZHANG, R. A. TAPIA, AND J. E. DENNIS, On the superlinear and quadratic convergence of primal-dual interior-point linear programming algorithms, SIAM J. Optim., 2 (1992), pp. 304-324.
26. Y. ZHANG, R. A. TAPIA, AND F. A. POTRA, On the superlinear convergence of interior-point algorithms for a general class of problems, SIAM J. Optim., 3 (1993), pp. 413-422.