The iteration-stability bound claimed for the explicit-implicit Euler discretization of the Euler-Lagrange acceleration ODE is not proven and is false for some parameter values permitted by the theorem.
A method for solving convex programming problems with convergence rate o(1/k2)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.OC 1years
2019 1verdicts
REJECT 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
On the stability of optimization algorithms given by discretizations of the Euler-Lagrange ODE
The iteration-stability bound claimed for the explicit-implicit Euler discretization of the Euler-Lagrange acceleration ODE is not proven and is false for some parameter values permitted by the theorem.