REVIEW 2 cited by
The primal-dual hybrid gradient method reduces to a primal method for linearly constrained optimization problems
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
Signed reviews
read the original abstract
In this work, we show that for linearly constrained optimization problems the primal-dual hybrid gradient algorithm, analyzed by Chambolle and Pock [3], can be written as an entirely primal algorithm. This allows us to prove convergence of the iterates even in the degenerate cases when the linear system is inconsistent or when the strong duality does not hold. We also obtain new convergence rates which seem to improve existing ones in the literature. For a decentralized distributed optimization we show that the new scheme is much more efficient than the original one.
Forward citations
Cited by 2 Pith papers
-
CB$^2$O: Consensus-Based Bi-Level Optimization
CB2O is a consensus-based optimization method with a quantile selection step that provably converges to the upper-level minimizer among the lower-level minimizers in the mean-field limit.
-
Two Adaptive Accelerated Golden Ratio Primal--Dual Algorithms With an Application to Poisson Imaging Problem
An adaptive golden-ratio primal-dual algorithm is shown to need no step-size cap or linesearch, with O(1/N) rates, plus two strongly-convex-focused variants with O(1/N²) rates.
Discussion (0). Continue with ORCID to comment.