A corrector–predictor path-following method for second-order cone optimization

References

• I. Adler and F. Alizadeh, Primal–dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems, Technical Report RRR-111-95, Brunswick, NJ: Rutger Center for Operations Research; 1995.
   Google Scholar
• F. Alizadeh and D. Goldfarb, Second-order cone optimization, Math Program Ser B. 95 (2003), pp. 3–51. doi: 10.1007/s10107-002-0339-5
   Web of Science ®Google Scholar
• Z. Darvay, New interior point algorithms in linear programming, Adv Model Optim. 5(1) (2003), pp. 51–92.
   Google Scholar
• L. Faybusovich, Linear systems in Jordan algebras and primal–dual interior point algorithms, J Comput Appl Math. 86 (1997), pp. 149–175. doi: 10.1016/S0377-0427(97)00153-2
   Web of Science ®Google Scholar
• G. Gu, M. Zangiabadi, and C. Roos, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Eur J Oper Res. 214(3) (2011), pp. 473–484. doi: 10.1016/j.ejor.2011.02.022
   Web of Science ®Google Scholar
• D.R. Han, On the coerciveness of some merit functions for complementarity problems over symmetric cones, J Math Anal Appl. 336(1) (2007), pp. 727–737. doi: 10.1016/j.jmaa.2007.03.003
   Web of Science ®Google Scholar
• T. Illés and M. Nagy, A Mizuno–Todd–Ye type predictor–corrector algorithm for sufficient linear complementarity problems, Eur J Oper Res. 181 (2007), pp. 1097–1111. doi: 10.1016/j.ejor.2005.08.031
   Web of Science ®Google Scholar
• B. Kheirfam, A predictor–corrector interior-point algorithm for P∗(κ) horizontal linear complementarity problem, Numer Algorithms 66(2) (2014), pp. 349–361. doi: 10.1007/s11075-013-9738-3
   Web of Science ®Google Scholar
• B. Kheirfam, A predictor–corrector path-following algorithm for symmetric optimization based on Darvay's technique, Yugoslav J Oper Res. 24(1) (2014), pp. 35–51. doi: 10.2298/YJOR120904016K
   Google Scholar
• B. Kheirfam, A corrector–predictor path-following algorithm for semidefinite optimization, Asian-Eur J Math. 7(2) (2014), 1450028, 15 pp. doi: 10.1142/S1793557114500284
   Google Scholar
• B. Kheirfam, A corrector–predictor path-following method for convex quadratic symmetric cone optimization, J Optim Theory Appl. 164(1) (2015), pp. 246–260. doi: 10.1007/s10957-014-0554-2
   Web of Science ®Google Scholar
• B. Kheirfam and N. Mahdavi-Amiri, A full Nesterov–Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem, Bull Iran Math Soc. 40(3) (2014), pp. 541–564.
   Web of Science ®Google Scholar
• Y. Lim, Geometric means on symmetric cones, Archiv der Math. 75(1) (2000), pp. 39–45. doi: 10.1007/s000130050471
   Web of Science ®Google Scholar
• M.S. Lobo, L. Vandenberghe, S.E. Boyd, and H. Lebret, Applications of the second-order cone programming, Linear Algebra Appl. 284 (1998), pp. 193–228. doi: 10.1016/S0024-3795(98)10032-0
   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 (1993), pp. 964–981. doi: 10.1287/moor.18.4.964
   Web of Science ®Google Scholar
• R.D.C. Monteiro and T. Tsuchiya, Polynomial convergence of primal–dual algorithms for the second-order cone program based on the MZ-family of directions, Math Program. 88 (2000), pp. 61–83. doi: 10.1007/PL00011378
   Web of Science ®Google Scholar
• Y.E. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math Oper Res. 22(1) (1997), pp. 1–42. doi: 10.1287/moor.22.1.1
   Web of Science ®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
• J. Peng, C. Roos, and T. Terlaky, A new class of polynomial primal–dual interior-point methods for second-order cone optimization based on self-regular proximities, SIAM J Optim. 13(1) (2002), pp. 179–203. doi: 10.1137/S1052623401383236
   Web of Science ®Google Scholar
• J. Peng, T. Terlaky, and Y. Zhao, A predictor–corrector algorithm for linear optimization based on a specific self-regular proximity function, SIAM J Optim. 15(4) (2005), pp. 1105–1127. doi: 10.1137/040603991
   Web of Science ®Google Scholar
• S.H. Schmieta and F. Alizadeh, Extension of primal–dual interior-point algorithms to symmetric cones, Math Program. 96(3) (2003), pp. 409–438. doi: 10.1007/s10107-003-0380-z
   Web of Science ®Google Scholar
• G. Sonnevend, G. Stoer, and G. Zhao, On the complexity of following the central path of linear programs by linear extrapolation, Methods Oper Res. 62 (1990), pp. 19–31.
   Google Scholar
• M.V.C. Vieira, Jordan algebraic approach to symmetric optimization, Ph.D thesis, Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, The Netherlands, 2007.
   Google Scholar
• G.Q. Wang and Y.Q. Bai, A primal–dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Appl Math Comput. 215 (2009), pp. 1047–1061. doi: 10.1016/j.amc.2009.06.034
   Web of Science ®Google Scholar