Pages that link to "Item:Q5206941"
From MaRDI portal
The following pages link to Optimal Convergence Rates for Nesterov Acceleration (Q5206941):
Displaying 31 items.
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions (Q2020604) (← links)
- Convergence results of two-step inertial proximal point algorithm (Q2085649) (← links)
- Convergence rates of first- and higher-order dynamics for solving linear ill-posed problems (Q2088139) (← links)
- Convergence rates of damped inerial dynamics from multi-degree-of-freedom system (Q2091224) (← links)
- On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping (Q2106043) (← links)
- Inertial projection and contraction algorithms with larger step sizes for solving quasimonotone variational inequalities (Q2114595) (← links)
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem (Q2181667) (← links)
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence (Q2192627) (← links)
- An extension of the second order dynamical system that models Nesterov's convex gradient method (Q2232772) (← links)
- Stochastic optimization with momentum: convergence, fluctuations, and traps avoidance (Q2233558) (← links)
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization (Q2235149) (← links)
- Convergence rates of the heavy-ball method under the Łojasiewicz property (Q2687044) (← links)
- Optimal decay rates for semi-linear non-autonomous evolution equations with vanishing damping (Q2693996) (← links)
- Optimal convergence rates for damped inertial gradient dynamics with flat geometries (Q2694484) (← links)
- Convergence Rates of Damped Inertial Dynamics under Geometric Conditions and Perturbations (Q3300770) (← links)
- Convergence Rates of Inertial Primal-Dual Dynamical Methods for Separable Convex Optimization Problems (Q3382782) (← links)
- Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
- Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem (Q5089998) (← links)
- Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization (Q5097013) (← links)
- From the Ravine Method to the Nesterov Method and Vice Versa: A Dynamical System Perspective (Q5097023) (← links)
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case <i>α</i> ≤ 3 (Q5107904) (← links)
- Convergence rate of a relaxed inertial proximal algorithm for convex minimization (Q5110325) (← links)
- Fast convergence of inertial dynamics with Hessian-driven damping under geometry assumptions (Q6058513) (← links)
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods (Q6073850) (← links)
- Double inertial parameters forward-backward splitting method: Applications to compressed sensing, image processing, and SCAD penalty problems (Q6085639) (← links)
- FISTA is an automatic geometrically optimized algorithm for strongly convex functions (Q6120847) (← links)
- Inertial Newton algorithms avoiding strict saddle points (Q6145046) (← links)
- The Nesterov accelerated gradient algorithm for auto-regressive exogenous models with random lost measurements: interpolation method and auxiliary model method (Q6197183) (← links)
- Stochastic differential equations for modeling first order optimization methods (Q6490316) (← links)
- Generalized proximal point algorithms with correction terms and extrapolation (Q6536963) (← links)
- Optimal convergence rate of inertial gradient system with flat geometries and perturbations (Q6569359) (← links)