On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"
read the original 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(\sqrt{\nu}\log \varepsilon^{-1})$ iterations, where $\nu$ 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 paper has not been read by Pith yet.
Forward citations
Cited by 4 Pith papers
-
Finite-size general security for differential phase shift keying via variable-length quantum key distribution
Finite-size general security for DPSK QKD is achieved with positive key rates for 10^5 signals beyond 12 dB loss via variable-length entropy accumulation and conic optimization.
-
Finite-size quantum key distribution rates from R\'enyi entropies using conic optimization
A general conic optimization solver computes finite-size QKD rates from Rényi entropies more reliably than prior Frank-Wolfe methods.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical advances in security proofs for QKD protocols that incorporate device imperfections to bridge theory and practice.
-
Quantum Key Distribution with Imperfections: Recent Advances in Security Proofs
Overview of recent analytical and numerical developments in QKD security proofs that incorporate imperfections to re-establish security under realistic conditions.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.