Performance enhancements for a generic conic interior point algorithm
Chris Coey, Lea Kapelevich, Juan Pablo Vielma
备注：
This preprint has not undergone peer review or any post-submission improvements or corrections. The Version of Record of this article is published in Mathematical Programming Computation, and is available online at https://doi.org/10.1007/s12532-022-00226-0
In recent work, we provide computational arguments for expanding the class of proper cones recognized by conic optimization solvers, to permit simpler, smaller, more natural conic formulations. We define an exotic cone as a proper cone for which we can implement a small set of tractable (i.e. fast, numerically stable, analytic) oracles for a logarithmically homogeneous self-concordant barrier for the cone or for its dual cone. Our extensible, open source conic interior point solver, Hypatia, allows modeling and solving any conic optimization problem over a Cartesian product of exotic cones. In this paper, we introduce Hypatia's interior point algorithm. Our algorithm is based on that of Skajaa and Ye [2015], which we generalize by handling exotic cones without tractable primal oracles. With the goal of improving iteration count and solve time in practice, we propose a sequence of four enhancements to the interior point stepping procedure of Skajaa and Ye [2015]: (1) loosening the central path proximity condition, (2) adjusting the directions using a third order directional derivative barrier oracle, (3) performing a backtracking search on a curve, and (4) combining the prediction and centering directions. We implement 23 useful exotic cones in Hypatia. We summarize the complexity of computing oracles for these cones, showing that our new third order oracle is not a bottleneck, and we derive efficient and numerically stable oracle implementations for several cones. We generate a diverse benchmark set of 379 conic problems from 37 different applied examples. Our computational testing shows that each stepping enhancement improves Hypatia's iteration count and solve time. Altogether, the enhancements reduce the shifted geometric means of iteration count and solve time by over 80% and 70% respectively.
A primal--dual interior-point method for nonsymmetric conic optimization with conjugate-free scaling
Nankai University（南开大学）；Suzhou University of Science and Technology（苏州科技大学）；Academy of Mathematics and Systems Science, Chinese Academy of Sciences（中国科学院数学与系统科学研究院）；University of Chinese Academy of Sciences（中国科学院大学）
Stochastic interior-point methods for smooth conic optimization with applications
Department of Mathematics, Linköping University, Sweden（林雪平大学数学系）；Academy for Advanced Interdisciplinary Studies, Peking University, China（北京大学交叉学科研究院）
A Practical GPU-Enhanced Matrix-Free Primal-Dual Method for Large-Scale Conic Programs
Purdue University（普渡大学）；H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology（佐治亚理工学院 H. 米尔顿·斯图尔特工业与系统工程学院）；Antai School of Economics and Management, Shanghai Jiao Tong University（上海交通大学安泰经济与管理学院）；Department of Management Science and Engineering, Stanford University（斯坦福大学管理科学与工程系）
