Towards non-symmetric conic optimization

In this paper, we propose a new interior-point method, which is based on an extension of the ideas of self-scaled optimization to the general cases. We suggest using the primal correction process to find a scaling point. This point is used to compute a strictly feasible primal–dual pair by simple projection. Then, we define an affine-scaling direction and perform a prediction step. This is the only moment when the dual barrier is used. Thus, we need only to compute its value, which can even be done approximately. In the second part of the paper, we develop a 4n-self-concordant barrier for an n-dimensional p-cone, which can be used for numerical testing of the proposed technique.

[1]  Yinyu Ye,et al.  An Efficient Algorithm for Minimizing a Sum of p-Norms , 1999, SIAM J. Optim..

[2]  Y. Nesterov,et al.  Self-Scaled Cones and Interior-Point Methods in Nonlinear Programming , 1994 .

[3]  Levent Tunçel,et al.  Generalization of Primal—Dual Interior-Point Methods to Convex Optimization Problems in Conic Form , 2001, Found. Comput. Math..

[4]  Roland W. Freund,et al.  On self-concordant barrier functions for conic hulls and fractional programming , 1996, Math. Program..

[5]  Levent Tunçel,et al.  “Cone-free” primal-dual path-following and potential-reduction polynomial time interior-point methods , 2005, Math. Program..

[6]  Yurii Nesterov,et al.  Long-step strategies in interior-point primal-dual methods , 1997, Math. Program..

[7]  Yurii Nesterov,et al.  Introductory Lectures on Convex Optimization - A Basic Course , 2014, Applied Optimization.

[8]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[9]  James Renegar,et al.  A mathematical view of interior-point methods in convex optimization , 2001, MPS-SIAM series on optimization.

[10]  Farid Alizadeh,et al.  Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization , 1995, SIAM J. Optim..

[11]  Osman Güler,et al.  Hyperbolic Polynomials and Interior Point Methods for Convex Programming , 1997, Math. Oper. Res..

[12]  Michael J. Todd,et al.  Self-Scaled Barriers and Interior-Point Methods for Convex Programming , 1997, Math. Oper. Res..

[13]  Kim-Chuan Toh,et al.  On the Nesterov-Todd Direction in Semidefinite Programming , 1998, SIAM J. Optim..

[14]  Michael J. Todd,et al.  Primal-Dual Interior-Point Methods for Self-Scaled Cones , 1998, SIAM J. Optim..