On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"

MaRDI QIDQ6294706zbMATH OpenFDO

Authors Dávid Papp, Sercan Yıldız

Publication date 1 December 2017

Has companion code repository https://github.com/dpapp-github/alfonso

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)

Abstract: In a recent paper, Skajaa and Ye proposed a homogeneous primal-dual interior-point method for non-symmetric conic optimization. The authors showed that their algorithm converges to $varepsilon$-accuracy in $O(sqrtulogvarepsilo{n}^{-1})$ iterations, where $u$ is the complexity parameter associated with a barrier function for the primal cone, and thus achieves the best-known iteration complexity for this class of problems. However, an earlier result from the literature was used incorrectly in the proofs of two intermediate lemmas in that paper. In this note, we propose new proofs of these results, allowing the same complexity bound to be established.

This page was built for publication: On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6294706)