← All setups

Radius Composite Accelerated — Radius-Constrained Composite Convex Minimization

Descriptions may be stale. Consult the linked Lean sources.

Radius-Constrained Composite Convex Minimization · Lean proof

Radius-Constrained Composite Convex Minimization

We minimize F=f+ψ over a convex set Q in a real Hilbert space E, where f:E→R is differentiable and convex and ψ:E→R is convex on Q. The function f is (L0,L1)-smooth, with L0>0 and L1≥0. A given x0∈Q satisfies ∥x0−x⋆∥≤R and ∥∇f(x⋆)∥≤G for some minimizer x⋆, where R>0 and G≥0. The oracle returns exact gradients and constrained proximal minimizers. For ε>0, the goal is a feasible output x¯∈Q with F(x¯)−F(x⋆)≤ε almost surely under P, the law of the algorithm’s randomness.

Writing F(x)=f(x)+ψ(x), the optimization problem is minx∈QF(x). The norm ∥⋅∥ is induced by the inner product ⟨⋅,⋅⟩ on E. The algorithm receives E, L0, L1, R, ε, and x0; the bound G may enter only the oracle-call budget.

Our assumptions:

Assumption 1 (Convexity). The set Q⊆E is convex. For every t∈[0,1], f((1−t)x+ty)≤(1−t)f(x)+tf(y),x,y∈E,ψ((1−t)x+ty)≤(1−t)ψ(x)+tψ(y),x,y∈Q.

Assumption 2 (Generalized smoothness). The function f is Fréchet differentiable everywhere on E, and ∇f:E→E is continuous. For every x,y∈E and M∈R, ∥∇f(x+θ(y−x))∥≤Mfor all θ∈[0,1]⟹∥∇f(x)−∇f(y)∥≤(L0+L1M)∥x−y∥.

Assumption 3 (Exact proximal minimization). There is a map T:R×E×E→E such that, for every a>0 and z,v∈E, T(a,z,v)∈argminu∈Q{∥u−z∥22a+⟨v,u−z⟩+ψ(u)}.

Assumption 4 (Initial distance and minimizer gradient). The given starting point satisfies x0∈Q. There exists x⋆∈Q such that F(x⋆)≤F(x)for every x∈Q,∥x0−x⋆∥≤R,∥∇f(x⋆)∥≤G.

The oracle returns ∇f(x) at x. It also returns T(a,z,v) on a proximal query (a,z,v). Gradient queries may use any x∈E, and proximal queries may use any a∈R and z,v∈E; the proximal minimization requirement applies only for a>0. Both query types count toward a single total oracle-call budget.

After the allotted calls, the output must satisfy x¯∈Q,F(x¯)−F(x⋆)≤εP-a.s. Here P is the law of the algorithm’s randomness, and x⋆ is a fixed minimizer independent of that randomness.

Proved result

⌈32768⋅((1+L1⋅R)43+(L0+L1⋅G)⋅R2ε)⋅(log⁡(128⋅(1+L1⋅R+(L0+L1⋅G)⋅R2ε)))2⌉+

OracleTemplate.Convergence LongTails.Setups.RadiusCompositeGeneralizedSmooth.spec
  OracleTemplate.RadiusCompositeAccelerated.budget

Relevant previous results

No qualifying prior reference verified; this is not a proof of novelty.