Energy stability of the Semi and Forward–Backward (FB) algorithms
Establish energy stability for the two explicit proximal schemes derived from the underdamped inertial dynamics ddot{x}(t)+ (α/t) dot{x}(t) − (α/t) ⟨∇F(x(t)), dot{x}(t)⟩ 1 + γ(t) ∇^2F(x(t)) dot{x}(t) + β(t) ∇F(x(t)) = 0, namely (i) the semi‑discretized algorithm defined by y^k = x^k + (k/(k+α))(x^k − x^{k−1}) + (α/(k+α))⟨∇F(x^k), x^k − x^{k−1}⟩ 1 + (k h/(k+α)) γ_k ∇F(x^k), μ_k = (k h/(k+α))(γ_k + β_k h), and x^{k+1} = prox_{μ_k F}(y^k), and (ii) the forward–backward algorithm defined by y^k = x^k + (k/(k+α))(x^k − x^{k−1}) + (α/(k+α))(F(x^k) − F(x^{k−1})) 1 + (k h/(k+α)) γ_k ∇F(x^k), μ_k = (k h/(k+α))(γ_k + β_k h), and x^{k+1} = prox_{μ_k F}(y^k). Specifically, prove that a suitable discrete Lyapunov/energy functional is nonincreasing along the iterations of each algorithm under appropriate regularity and convexity assumptions on F and appropriate choices of α, γ_k, β_k, and h.
References
We note that, for these two methods derived from the Euler method, we have yet able to establish energy stability for them.
For future work, it would be of interest to develop an inertial primal-dual dynamical system with asymptotic vanishing damping and implicit Hessian-driven damping for solving ``smooth + nonsmooth" composite convex optimization problems with linear equality constraints.
The original paper explicitly left open the status of this restriction: ``It is an open question whether this constraint is a technical artifact or is fundamental to acceleration. We leave it to a future work.'' Remark~3.