Error bounds and limiting behavior of weighted paths associated with the SDP MAP X 1/2SX 1/2

SIAM Journal on Optimization

Volumn 15, Issue 2, 2005, Pages 348-374

  Zhaosong, L U ^a   Monteiro, Renato D C ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Error bound; Limiting behavior; Semideflnite programming (SDP); Superlinear convergence; Weighted central path

Indexed keywords

ERROR BOUND; LIMITING BEHAVIOR; SEMIDEFINITE PROGRAMMING (SDP); SUPERLINEAR CONVERGENCE; WEIGHTED CENTRAL PATH;

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; OPTIMIZATION; PROBLEM SOLVING;

NONLINEAR PROGRAMMING;

EID: 18744366647     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623403430828     Document Type: Article

References (40)

1. I. ADLER AND R. D. C. MONTEIRO, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming, 50 (1991), pp. 29-51.
2. M. D. ASIC, V. V. KOVACEVIC-VUJCIC, AND M. D. RADOSAVLJEVIC-NIKOLIC, A note on limiting behavior of the projective and the affine rescaling algorithms, in Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference, Bowdoin College, Brunswick, ME, 1988, Contemp. Math., AMS, 114, J. C. Lagarias and M. J. Todd, eds., Providence, RI, 1990, pp. 151-157.
3. D. A. BAYER AND J. C. LAGARIAS, The nonlinear geometry of linear programming, I: Affine and projective scaling trajectories, Trans. Amer. Math. Soc., 314 (1989), pp. 499-526.
4. J. DA CRUZ NETO, O. FERREIRA, AND R. D. C. MONTEIRO, Asymptotic Behavior of the Central Path for a Special Class of Degenerate SDP Problems, manuscript, School of ISyE, Georgia Institute of Technology, Atlanta, GA, 2003.
5. E. DE KLERK, C. ROOS, AND T. TERLAKY, Initialization in semidefinite programming via a self-dual, skew-symmetric embedding, Oper. Res. Lett., 20 (1997), pp. 213-221.
6. E. DE KLERK, C. ROOS, AND T. TERLAKY, Infeasible-start semidefinite programming algorithms via self-dual embeddings, in Topics in Semidefinite and Interior-Point Methods, Fields Inst. Commun. 18, P. M. Pardalos and H. Wolkowicz, eds., AMS, Providence, RI, 1998, pp. 215-236.
7. D. GOLDPARB AND K. SCHEINBERG, Interior point trajectories in semidefinite programming, SIAM J. Optim., 8 (1998), pp. 871-886.
8. L. M. G. DRUMMOND AND H. Y. PETERZIL, The central path in smooth convex semidefinite programs, Optimization, 51 (2002), pp. 207-233.
9. O. GÜLER, Limiting behavior of the weighted central paths in linear programming, Math. Programming, 65 (1994), pp. 347-363.
10. M. HALICKÁ, Analytical properties of the central path at the boundary point in linear programming, Math. Program., 84 (1999), pp. 335-355.
11. M. HALICKÁ, Two simple proofs of analyticity of the central path in linear programming, Oper. Res. Lett., 28 (2001), pp. 9-19.
12. M. HALICKÁ, Analyticity of the central path at the boundary point in semidefinite programming, European J. Oper. Res., 143 (2002), pp. 311-324.
13. M. HALICKÁ, E. DE KLERK, AND C. ROOS, Limiting Behavior of the Central Path in Semidefinite Optimization, preprint, Faculty of Technical Mathematics and Informatics, TU Delft, Delft, The Netherlands, 2002.
14. M. HALICKÁ, E. DE KLERK, AND C. ROOS, On the convergence of the central path in semidefinite optimization, SIAM J. Optim., 12 (2002), pp. 1090-1099.
15. M. KOJIMA, N. MEGIDDO, T. NOMA, AND A. YOSHISE, A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems, Lecture Notes in Comput. Sci. 538, Springer-Verlag, Berlin, 1991.
16. M. KOJIMA, S. MIZUNO, AND T. NOMA, Limiting behavior of trajectories by a continuation method for monotone complementarity problems, Math. Oper. Res., 15 (1990), pp. 662-675.
17. M. KOJIMA, M. SHIDA, AND S. SHINDOH, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, Math. Programming, 80 (1998), pp. 129-160.
18. M. KOJIMA, M. SHIDA, AND S. SHINDOH, A predictor-corrector interior-point algorithm for the semidefinite linear complementarity problem using the Alizadeh-Haeberly-Overton search direction, SIAM J. Optim., 9 (1999), pp. 444-465.
19. M. KOJIMA, S. SHINDOH, AND S. HARA, Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices, SIAM J. Optim., 7 (1997), pp. 86-125.
20. Z. LU AND R. D. C. MONTEIRO, Limiting Behavior of the Alizadeh-Haeberly-Overton Weighted Paths in Semidefinite Programming, manuscript, School of ISyE, Georgia Institute of Technology, Atlanta, GA, 2003.
21. Z.-Q. LUO, J. F. STURM, AND S. ZHANG, Superlinear convergence of a symmetric primal-dual path following algorithm for semidefinite programming, SIAM J. Optim., 8 (1998), pp. 59-81.
22. 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.
23. L. MCLINDEN, The complementarity problem for maximal monotone multifunctions, in Variational Inequalities and Complementarity Problems, R. Cottle, F. Giannessi, and J.-L. Lions, eds., Wiley, New York, 1980, pp. 251-270.
24. 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.
25. J. MILNOR, Singular Points of Complex Hypersurfaces, Ann. of Math. Stud. 61, Princeton University Press, Princeton, NJ, 1968.
26. R. D. C. MONTEIRO, Convergence and boundary behavior of the protective scaling trajectories for linear programming, Math. Oper. Res., 16 (1991), pp. 842-858.
27. R. D. C. MONTEIRO AND J.-S. PANG, Properties of an interior-point mapping for mixed complementarity problems, Math. Oper. Res., 21 (1996), pp. 629-654.
28. R. D. C. MONTEIRO AND J.-S. PANG, On two interior-point mappings for nonlinear semidefinite complementarity problems, Math. Oper. Res., 23 (1998), pp. 39-60.
29. R. D. C. MONTEIRO AND T. TSUCHIYA, Limiting behavior of the derivatives of certain trajectories associated with a monotone horizontal linear complementarity problem, Math. Oper. Res., 21 (1996), pp. 793-814.
30. R. D. C. MONTEIRO AND T. TSUCHIYA, Polynomial convergence of a new family of primal-dual algorithms for semidefinite programming, SIAM J. Optim., 9 (1999), pp. 551-577.
31. R. D. C. MONTEIRO AND P. ZANJÁCOMO, General interior-point maps and existence of weighted paths for nonlinear semidefinite complementarity problems, Math. Oper. Res., 25 (2000), pp. 381-399.
32. R. D. C. MONTEIRO AND F. ZHOU, On the existence and convergence of the central path for convex programming and some duality results, Comput. Optim. Appl., 10 (1998), pp. 51-77.
33. F. A. POTRA AND R. SHENG, Superlinear Convergence of Interior-P oint Algorithms for Semidefinite Programming, Reports on Computational Mathematics 86, Department of Mathematics, The University of Iowa, Iowa City, IA, 1996.
34. F. A. POTRA AND R. SHENG, A superlinearly convergent primal-dual infeasible-interior-point algorithm for semidefinite programming, SIAM J. Optim., 8 (1998), pp. 1007-1028.
35. M. PREIß AND J. STOER, Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems, Math. Program., 99 (2003), pp. 499-520.
36. G. SPORRE AND A. FORSGREN, Characterization of the Limit Point of the Central Path in Semidefinite Programming, Technical report TRITA-MAT-2002-OS12, Department of Mathematics, Royal Institute of Technology, Stockholm, Sweden, 2002.
37. J. STOER AND M. WECHS, Infeasible-interior-point paths for sufficient linear complementarity problems, Math. Programming, 83 (1998), pp. 403-423.
38. J. STOER AND M. WECHS, On the analyticity properties of infeasible-interior point paths for monotone linear complementarity problems, Numer. Math., 81 (1999), pp. 631-645.
39. M. WECHS, The analyticity of interior-point-paths at strictly complementary solutions of linear programs, Optim. Methods Softw., 9 (1998), pp. 209-243.
40. C. WITZGALL, P. T. BOGGS, AND P. D. DOMICH, On the convergence behavior of trajectories for linear programming, in Mathematical Developments Arising from Linear Programming: Proceedings of a Joint Summer Research Conference, Bowdoin College, Brunswick, ME, 1988, Contemp. Math. 114, J. C. Lagarias and M. J. Todd, eds., AMS, Providence, RI, 1990, pp. 161-187.