A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization.

A new primal-dual interior-point algorithm applicable to nonsymmetric conic optimization is proposed. It is a generalization of the famous algorithm suggested by Nesterov and Todd for the symmetric conic case, and uses primal-dual scalings for nonsymmetric cones proposed by Tuncel. We specialize Tuncel's primal-dual scalings for the important case of 3 dimensional exponential-cones, resulting in a practical algorithm with good numerical performance, on level with standard symmetric cone (e.g., quadratic cone) algorithms. A significant contribution of the paper is a novel higher-order search direction, similar in spirit to a Mehrotra corrector for symmetric cone algorithms. To a large extent, the efficiency of our proposed algorithm can be attributed to this new corrector.

Citation

Unpublished, Technical Report, May 2019, MOSEK ApS, Fruebjergvej 3, 2100 Copenhagen O, Denmark.

Article

Download

View A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization.