An algorithm for nonsymmetric conic optimization inspired by MOSEK

References

• F. Alizadeh and S. Schmieta, Symmetric cones, potential reduction methods and word-by-word extensions, in Handbook of Semidefinite Programming, H. Wolkowicz, R. Saigal, and L. Vandenberghe, eds., Springer, Boston, MA, 2000, pp. 195–233.
   Google Scholar
• E.D. Andersen and Y. Ye, On a homogeneous algorithm for the monotone complementarity problem, Math. Program. 84 (1999), pp. 375–399.
   Web of Science ®Google Scholar
• C.B. Chua, Relating homogeneous cones and positive definite cones via T-algebras, SIAM J. Optim. 14 (2003), pp. 500–506.
   Web of Science ®Google Scholar
• C.B. Chua, A T-algebraic approach to primal-dual interior-point algorithms, SIAM J. Optim. 20 (2009), pp. 503–523.
   Web of Science ®Google Scholar
• J. Dahl and E.D. Andersen, A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization, preprint (2019).
   Google Scholar
• 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, Vol. 18, P. M. Pardalos and H. Wolkowicz, eds., Fields Institute Communications, Providence, RI, 1998, pp. 215–236.
   Google Scholar
• 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.
   Web of Science ®Google Scholar
• O. Güler, Barrier functions in interior point methods, Math. Oper. Res. 21 (1996), pp. 860–885.
   Web of Science ®Google Scholar
• O. Güler, Hyperbolic polynomials and interior point methods for convex programming, Math. Oper. Res. 22 (1997), pp. 350–377.
   Web of Science ®Google Scholar
• R.A. Horn and C.R. Johnson, Topics in Matrix Analysis, Cambridge University Press, Cambridge, 1994.
   Google Scholar
• R.A. Horn and C.R. Johnson, Matrix Analysis, Cambridge University Press, New York, NY, 2012.
   Google Scholar
• P. Jordan, J. von Neumann, and E. Wigner, On an algebraic generalization of the quantum mechanic formalism, Ann. Math. 35 (1934), pp. 29-–64.
   Google Scholar
• N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984), pp. 373–395.
   Web of Science ®Google Scholar
• M. Lubin, E. Yamangil, R. Bent, and J.P. Vielma, Extended formulations in mixed-integer convex programming, in International Conference on Integer Programming and Combinatorial Optimization, Q. Louveaux and M. Skutella, eds., Springer, Cham, 2016, pp. 102–113.
   Google Scholar
• Z.Q. Luo, J.F. Sturm, and S. Zhang, Duality and self-duality for conic convex programming, Tech. Rep., Citeseer, 1996.
   Google Scholar
• A. Mohammad-Nezhad and T. Terlaky, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, Comput. Optim. Appl. 66 (2017), pp. 577-–600.
   Web of Science ®Google Scholar
• T. Myklebust and L. Tunçel, Interior-point algorithms for convex optimization based on primal-dual metrics, preprint (2016).
   Google Scholar
• Y.E. Nesterov and M.J. Todd, Self-scaled barriers and interior-point methods for convex programming, Math. Oper. Res. 22 (1997), pp. 1–42.
   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 (1998), pp. 324–364.
   Web of Science ®Google Scholar
• Y. Nesterov, M.J. Todd, and Y. Ye, Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems, Math. Program. 84 (1999), pp. 227-–267.
   Web of Science ®Google Scholar
• Y. Nesterov, Towards non-symmetric conic optimization, Optim. Methods Softw. 27 (2012), pp. 893–917.
   Web of Science ®Google Scholar
• Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994.
   Google Scholar
• F.A. Potra and R. Sheng, On homogeneous interrior-point algorithms for semidefinite programming, Optim. Methods Softw. 9 (1998), pp. 161–184.
   Web of Science ®Google Scholar
• J. Renegar, Hyperbolic programs, and their derivative relaxations, Tech. Rep., Cornell University Operations Research and Industrial Engineering, 2004.
   Google Scholar
• S. Schmieta and F. Alizadeh, Extension of polynomial time interior-point algorithms to symmetric cones, Math. Program. 96 (2003), pp. 409–438.
   Web of Science ®Google Scholar
• S. Schmieta and F. Alizadeh, Associative and jordan algebras, and polynomial time interior-point algorithms for symmetric cones, Math. Oper. Res. 26 (2001), pp. 543–564.
   Web of Science ®Google Scholar
• S.A. Serrano, Algorithms for unsymmetric cone optimization and an implementation for problems with the exponential cone, Ph.D. diss., Stanford University, 2015.
   Google Scholar
• A. Skajaa and Y. Ye, A homogeneous interior-point algorithm for nonsymmetric convex conic optimization, Math. Program. 150 (2015), pp. 391–422.
   Web of Science ®Google Scholar
• L. Tunçel, Generalization of primal-dual interior-point methods to convex optimization problems in conic form, Found. Comput. Math. 1 (2001), pp. 229–254.
   Web of Science ®Google Scholar
• Y. Ye, M.J. Todd, and S. Mizuno, An O(nL)-iteration homogeneous and self-dual linear programming algorithm, Math. Oper. Res. 19 (1994), pp. 53–67.
   Web of Science ®Google Scholar