TL;DR
Alfonso is an open-source Matlab package that efficiently solves nonsymmetric convex cone optimization problems using a primal-dual interior-point method, expanding capabilities beyond symmetric cones with proven iteration complexity.
Contribution
The paper introduces alfonso, a Matlab package implementing a corrected primal-dual interior-point method for nonsymmetric cone optimization, with improved performance and broad applicability.
Findings
Achieves optimal iteration complexity of O(√ν log(1/ε)) for nonsymmetric cones.
Enables solving problems over a wide class of nonsymmetric cones, including hyperbolicity and exponential cones.
Demonstrates significant solution time improvements in design of experiments applications.
Abstract
We present alfonso, an open-source Matlab package for solving conic optimization problems over nonsymmetric convex cones. The implementation is based on the authors' corrected analysis of a primal-dual interior-point method of Skajaa and Ye. This method enables optimization over any convex cone as long as a logarithmically homogeneous self-concordant barrier is available for the cone or its dual. This includes many nonsymmetric cones, for example, hyperbolicity cones and their duals (such as sum-of-squares cones), semidefinite and second-order cone representable cones, power cones, and the exponential cone. Besides enabling the solution of problems which cannot be cast as optimization problems over a symmetric cone, it also offers performance advantages for problems whose symmetric cone programming representation requires a large number of auxiliary variables or has a special structure…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
