A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function

References

• Karmarkar NK. New polynomial-time algorithm for linear programming.Combinatorica. 1984;4;373–395.
   Google Scholar
• Nesterov YE, Nemirovskii AS. Interior point polynomial algorithms in convex programming. Vol. 13, SIAM studies in applied mathematics. Philadelphia (PA): SIAM; 1994.
   Google Scholar
• Yu Q, Huang C, Jiang Y. A polynomial predictor--corrector interior point algorithm for convex quadratic programming. Acta Math. Sci. 2006;26:265–270.
   Web of Science ®Google Scholar
• Andersen ED, Gondzio J, Meszaros C, et al. Implementation of interior point methods for large scale linear programming. In: Terlaky T, editor. Interior point methods of mathematical programming. Dordrecht: Kluwer Academic; 1996. p. 189–252.
   Google Scholar
• Andersen ED, Roos C, Terlaky T. On implementing a primal--dual interior-point method for conic quadratic optimization. Math. Program. Ser. B. 2003;95:249–277.
   Web of Science ®Google Scholar
• Sturm JF. Implementation of interior point methods for mixed semidefinite and second order cone optimization problems. Optim. Methods Softw. 2002;17:1105–1154.
   Web of Science ®Google Scholar
• Sturm JF. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 1999;11:625–653.
   Web of Science ®Google Scholar
• Tsuchiya T. A polynomial primal--dual path-following algorithm for second-order cone programming. Tokyo, Japan: The Institute of Statistical Mathematics; 1997. (Research Memorandum no. 649 ).
   Google Scholar
• Tsuchiya T. A convergence analysis of the scaling-invariant primal--dual path-following algorithms for second-order cone programing. Optim. Methods Softw. 1999;11:141–182.
   Web of Science ®Google Scholar
• Nesterov YE, Todd MJ. Primal--dual interior point methods for self-scaled cone. SIAM J. Optim. 1998;8:324–364.
   Web of Science ®Google Scholar
• Ben-Tal A, Nemirovskii AS. Robust convex optimization. Math. Oper. Res. 1998;23:769–805.
   Web of Science ®Google Scholar
• Ben-Tal A, Nemirovskii AS. Robust solutions of uncertain linear programs. Oper. Res. Lett. 1999;25:113–148.
   Web of Science ®Google Scholar
• El Ghaoui L, Lebret H. Robust solutions to least squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 1997;18:1035–1064.
   Web of Science ®Google Scholar
• Lobo MS, Vandenberghe L, Boyd SE, et al. Applications of the second-order cone programming. Linear Algebra Appl. 1998;284:193–228.
   Web of Science ®Google Scholar
• Wolkowicz H, Saigal R, Vandenberghe L. Handbook of semidefinite programming. Theory, algorithms, and applications. International Series in Operations Research & Management Science. Vol. 27. Boston (MA): Kluwer Academic; 2000.
   Google Scholar
• Peng J, Roos C, Terlaky T. Self-regularity: a new paradigm for primal--dual interior-point algorithms. Princeton (NJ): Princeton University Press; 2002.
   Google Scholar
• Bai YQ, El Ghami M, Roos C. A comparative study of kernel functions for primal--dual interior-point algorithms in linear optimization. SIAM J. Optim. 2004;15:101–128.
   Web of Science ®Google Scholar
• Bai YQ, Wang GQ, Roos C. Primal--dual interior-point algorithms for second-order cone optimization based on kernel functions. J. Nonlinear Anal. 2009;70:3584–3602.
   Web of Science ®Google Scholar
• El Ghami M. Primal--dual interior-point methods for P*(κ)-linear complementarity problem based on a kernel function with a trigonometric barrier term. Optim. Theory Decis. Mak. Oper. Res. Appl. 2013;31:331–349.
   Google Scholar
• Fathi-Hafshejani S, Fatemi M, Peyghami MR. An interior-point method for P*(κ)-linear complementarity problem based on a trigonometric kernel function. J. Appl. Math. Comput. 2015;48:11–128.
   Google Scholar
• Kheirfam B. Primal--dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term. Numer. Algorithms. 2012;61:659–680.
   Web of Science ®Google Scholar
• Peyghami MR. An interior-point approach for semidefinite optimization using new proximity functions. Asia-Pac. J. Oper. Res. 2009;26:365–382.
   Web of Science ®Google Scholar
• Peyghami MR, Fathi-Hafshejani S, Shirvani L. Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function. J. Comput. Appl. Math. 2014;255:74–85.
   Web of Science ®Google Scholar
• Peyghami MR, Fathi-Hafshejani S. Complexity analysis of an interior point algorithm for linear optimization based on a new poriximity function. Numer. Algorithms. 2014;67:33–48.
   Web of Science ®Google Scholar
• Bai YQ. Primal--dual interior-point algorithms for second-order cone optimization based on new parametric kernel functions. Appl. Math. Mech. 2007;23:2027–2042.
   Google Scholar
• Chi X, Liu S. An infeasible interior point predictor--corrector algorithm for the second order cone programming. Acta Math. 2008;28:551–559.
   Web of Science ®Google Scholar
• Zhang YF, Bai YQ, Jian JB, et al. Two new predictor--corrector algorithms for second-order cone programming. Appl. Math. Mech. 2011;32:521–532.
   Web of Science ®Google Scholar
• Miao JM. Two infeasible interior point predictor--corrector algorithms for linear programming. SIAM J. Optim. 1996;6:587–599.
   Web of Science ®Google Scholar
• El Ghami M, Guennoun ZA, Boula S, et al. Interior-point method for linear optimization based on a kernel function with a trigonometric barrier term. J. Comput. Appl. Math. 2012;236:3613–3623.
   Web of Science ®Google Scholar
• Adler I, Alizadeh F. Primal--dual interior point algorithms for convex quadratically constrained and semidefinite optimization problems. Brunswick (NJ): Rutger center for Operations Research; 1995. ( Technical Report PRR,111--95).
   Google Scholar
• Faybusovich L. Linear systems in Jordan algebras and primal--dual interior-point algorithms. J. Comput. Appl. Math. 1997;86:149–175.
   Web of Science ®Google Scholar
• Schmieta SH, Alizadeh F. Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones. Math. Oper. Res. 2001;26:543–564.
   Web of Science ®Google Scholar
• Zangiabadi M, Gu G, Roos C. A full Nesterov--Todd step infeasible interior-point method for second-order cone optimization. J. Optim. Theory. Appl. 2013;158:816–858.
   Web of Science ®Google Scholar
• Roos C, Terlaky T, Vial J-P. Theory and algorithms for linear optimization: an interior point approach. New York (NY): Springer; 2005.
   Google Scholar
• Bai YQ, El Ghami M, Roos C. A new efficient large-update primal--dual interior-point methods based on a finite barrier. SIAM J. Optim. 2003;13:766–782.
   Web of Science ®Google Scholar