An predictor–corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood

References

• W. Ai and S. Zhang, An O(nL) iteration primal-dual path-following method, based on wide neighborhoods and large updates, for monotone LCP, SAIM J. Optim. 16(2) (2005), pp. 400–417. doi: 10.1137/040604492
   Web of Science ®Google Scholar
• F. Alizadeh, Combinatorial optimization with interior-point methods and semidefinite matrices, Ph.D. thesis, University of Minnesota, Minneapolis, MN, 1992.
   Google Scholar
• F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5(1) (1995), pp. 13–51. doi: 10.1137/0805002
   Web of Science ®Google Scholar
• Y.Q. Bai, G. Lesaja, and C. Roos, A new class of polynomial interior-point algorithms for P∗(κ) linear complementarity problems, Pacific J. Optim. 4(1) (2008), pp. 19–41.
   Web of Science ®Google Scholar
• S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, PA, 1994.
   Google Scholar
• E. de Klerk, Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications, Kluwer Academic Publishers, Dordrecht, 2002.
   Google Scholar
• Z. Feng and L. Fang, A wide neighborhood interior-point method with O(nL) iteration-complexity bound for semidefinite programming, Optimization 59(8) (2010), pp. 1235–1246. doi: 10.1080/02331930903104382
   Web of Science ®Google Scholar
• Z. Feng and L. Fang, A new O(nL)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming, J. Comput. Appl. Math. 256 (2014), pp. 65–76. doi: 10.1016/j.cam.2013.07.011
   Web of Science ®Google Scholar
• R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press, New York, 1990.
   Google Scholar
• T. Illés, M. Nagy, and T. Terlaky, A polynomial path-following interior point algorithm for general linear complementarity problems, J. Global Optim. 47(3) (2010), pp. 329–342. doi: 10.1007/s10898-008-9348-0
   Web of Science ®Google Scholar
• B. Kheirfam, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Numer. Algorithms 61(4) (2012), pp. 659–680. doi: 10.1007/s11075-012-9557-y
   Web of Science ®Google Scholar
• B. Kheirfam, An adaptive infeasible interior-point algorithm with full Nesterov-Todd step for semidefinite optimization, J. Math. Model. Algorithms Oper. Res. 14(1) (2015), pp. 55–66. doi: 10.1007/s10852-014-9257-9
   Google Scholar
• A.S. Lewis and M.L. Overton, Eigenvalue optimization, Acta Numer. 5 (1996), pp. 149–190. doi: 10.1017/S0962492900002646
   Google Scholar
• Y. Li and T. Terlaky, A new class of large neighborhood path-following interior-point algorithms for semidefinite optimization with O(nlog⁡(tr(X0S0)ε)) iteration complexity, SIAM J. Optim. 20(6) (2010), pp. 2853–2875. doi: 10.1137/080729311
   Web of Science ®Google Scholar
• C. Liu and H. Liu, A new second-order corrector interior-point algorithm for semidefinite programming, Math. Methods Oper. Res. 75(2) (2012), pp. 165–183. doi: 10.1007/s00186-012-0379-4
   Web of Science ®Google Scholar
• S. Merhrotra, On the implementation of a primal-dual interior point method, SIAM J. Optim. 2(4) (1992), pp. 575–601. doi: 10.1137/0802028
   Web of Science ®Google Scholar
• S. Mizuno, M.J. Todd, and Y. Ye, On adaptive step primal-dual interior-point algorithms for linear programming, Math. Oper. Res. 18(4) (1993), pp. 964–981. doi: 10.1287/moor.18.4.964
   Web of Science ®Google Scholar
• R.D.C. Monteiro, Primal-dual path-following algorithms for semidefinite programming, SIAM J. Optim. 7(3) (1997), pp. 663–678. doi: 10.1137/S1052623495293056
   Web of Science ®Google Scholar
• R.D.C. Monteiro, Polynomial convergence of primal-dual algorithms for semidefnite programming based on the Monteiro and Zhang family of directions, SIAM J. Optim. 8(3) (1998), pp. 797–812. doi: 10.1137/S1052623496308618
   Web of Science ®Google Scholar
• R.D.C. Monteiro, First-and second-order methods for semidefnite programming, Math. Program. 97(1) (2003), pp. 209–244. doi: 10.1007/s10107-003-0451-1
   Web of Science ®Google Scholar
• R.D.C. Monteiro and Y. Zhang, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Math. Program. 81(3) (1998), pp. 281–299. doi: 10.1007/BF01580085
   Web of Science ®Google Scholar
• Y.E. Nesterov and A.S. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
   Google Scholar
• Y.E. Nesterov and M.J. Todd, Primal-dual interior-point methods for self-scaled cones, SIAM J. Optim. 8(2) (1998), pp. 324–364. doi: 10.1137/S1052623495290209
   Web of Science ®Google Scholar
• M. Salahi and N. Mahdavi-Amiri, Polynomial time second order Mehrotra-type predictor-corrector algorithms, Appl. Math. Comput. 183(1) (2006), pp. 646–658.
   Web of Science ®Google Scholar
• M. Salahi, J. Peng, and T. Terlaky, On Mehrotra type predictor-corrector algorithms, SIAM J. Optim.18(4) (2008), pp. 1377–1397. doi: 10.1137/050628787
   Web of Science ®Google Scholar
• J.F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw. 11(1–4) (1999), pp. 625–653. doi: 10.1080/10556789908805766
   Web of Science ®Google Scholar
• M.J. Todd, K.C. Toh, R.H. Tütüncü, On the Nesterov-Todd direction in semidefinite programming. SIAM J. Optim. 8(3) (1998), pp. 769–796. doi: 10.1137/S105262349630060X
   Web of Science ®Google Scholar
• Y. Ye, A class of projective transformations for linear programming, SIAM J. Comput. 19(3) (1990), pp. 457–466. doi: 10.1137/0219030
   Web of Science ®Google Scholar
• Y. Zhang, On extending some primal-dual interior-point algorithms from linear programming to semidefinite programming, SIAM J. Optim. 8(2) (1998), pp. 365–386. doi: 10.1137/S1052623495296115
   Web of Science ®Google Scholar
• M. Zhang, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, J. Syst. Sci. Complex. 25(6) (2012), pp. 1108–1121. doi: 10.1007/s11424-012-0317-9
   Web of Science ®Google Scholar
• Y. Zhang and D. Zhang, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, Math. Program. 68(1) (1995), pp. 303–318. doi: 10.1007/BF01585769
   Google Scholar
• X. Yang, H. Liu, and Y. Zhang, A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighborhood for semidefinite programming, Int. J. Comput. Math. 91(5) (2014), pp. 1082–1096. doi: 10.1080/00207160.2013.827784
   Web of Science ®Google Scholar