← All setups

Feasible Gap Accelerated — Composite Minimization with Gap-Controlled Hessians

Descriptions may be stale. Consult the linked Lean sources.

Composite Minimization with Gap-Controlled Hessians · Lean proof

Composite Minimization with Gap-Controlled Hessians

We consider minimizing F=f+ψ over a convex set Q in a real Hilbert space E, where f,ψ:E→R are convex on Q. At each feasible point, f has a positive semidefinite Hessian satisfying ∥∇2f(x)∥op≤H0+H1(F(x)−F(x⋆)), where H0,H1≥0 and x⋆∈Q minimizes F. A given x0∈Q satisfies ∥x0−x⋆∥≤R and F(x0)−F(x⋆)≤Δ, with R,Δ>0. The oracle returns exact feasible gradients or exact proximal minimizers of ψ. For ε>0, the goal is x¯∈Q with F(x¯)−F(x⋆)≤ε almost surely.

The optimization problem is minx∈QF(x),F(x):=f(x)+ψ(x). The norm ∥⋅∥ is induced by the inner product on E, and ∥⋅∥op denotes the induced operator norm. The algorithm receives E, H0, H1, R, Δ, ε, and x0; the functions and feasible set are accessed through the oracle.

Our assumptions:

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

Assumption 2 (Minimizer and initialization). There exists x⋆∈Q such that x0∈Q and F(x⋆)≤F(x)for every x∈Q,∥x0−x⋆∥≤R,F(x0)−F(x⋆)≤Δ.

Assumption 3 (Feasible Hessian bound). At every x∈Q, the function f is Fréchet differentiable, and its gradient is Fréchet differentiable at x as a map on E. The Hessian ∇2f(x):E→E is a bounded self-adjoint linear operator satisfying ⟨∇2f(x)h,h⟩≥0for every h∈E,∥∇2f(x)∥op≤H0+H1(F(x)−F(x⋆)). These derivatives are ambient derivatives, including at boundary points of Q.

Assumption 4 (Exact proximal access). There is a map P:R×E×E→E such that, for every a>0 and z,v∈E, P(a,z,v)∈argminu∈Q{∥u−z∥22a+⟨v,u−z⟩+ψ(u)}. In particular, these minimizers exist and the returned point is feasible.

The oracle supports two query types. For a gradient query at x∈Q, the oracle returns ∇f(x) at x. For a proximal query (a,z,v)∈R×E×E, it returns P(a,z,v), with the minimization property above applying when a>0. Both query types count toward one common oracle-call budget.

After the allotted calls, the output must satisfy x¯∈Q,F(x¯)−F(x⋆)≤εP-a.s., where P is the joint law of the algorithm’s and oracle’s randomness, which are independent.

Proved result

⌈16777216⋅(1+R⋅H0ε+H1)⋅(log⁡(4+R2⋅(H0ε+H1)))2⋅log⁡(2+Δε)⌉+

OracleTemplate.Convergence LongTails.Setups.FeasibleHessianGapComposite.spec
  OracleTemplate.FeasibleGapAccelerated.budget

Relevant previous results

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