REVIEW 3 cited by
On "A Homogeneous Interior-Point Algorithm for Non-Symmetric Convex Conic Optimization"
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 3 Pith papers
-
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.
-
Effective discrete-modulated continuous variable QKD under general attacks
Finite-size security proof for discrete-modulated CV-QKD under general attacks using dimension reduction and entropy accumulation yields positive rates at block sizes of order 10^8.
-
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 to comment.