Papers › On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"
On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"
Dávid Papp, Sercan Yıldız
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
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 ε-accuracy in O(√(ν)logε⁻¹) iterations, where ν 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.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections