Accelerated Douglas Rachford Convex — Smooth Convex Proximal Minimization
Descriptions may be stale. Consult the linked Lean sources.
Smooth Convex Proximal Minimization · Lean proof
Smooth Convex Proximal Minimization
We consider minimizing
Write
Our assumptions:
Assumption 1 (Convexity and smoothness). The
function
Assumption 2 (Exact proximal access). For every
Assumption 3 (Minimizer and initial distance). There
exists
After the allotted oracle calls, the output must satisfy
Proved result
OracleTemplate.Convergence LongTails.Setups.DouglasRachfordSmoothConvex.spec OracleTemplate.DouglasRachford.budgetRelevant previous results
- Panagiotis Patrinos, Lorenzo Stella, Alberto Bemporad. Douglas-Rachford Splitting:
Complexity Estimates and Accelerated Variants. 2014 (CDC
publication; September 2014 preprint v2 used). Complexity:
exact proximal-oracle calls using fast Douglas–Rachford, counting both proximal evaluations per iteration, for objective gap ; .