Pages that link to "Item:Q2351985"
From MaRDI portal
The following pages link to On damped second-order gradient systems (Q2351985):
Displaying 29 items.
- From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
- Rate of convergence to equilibrium and Łojasiewicz-type estimates (Q1692106) (← links)
- Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity (Q1785926) (← links)
- Asymptotic analysis of a structure-preserving integrator for damped Hamiltonian systems (Q2030822) (← links)
- A control-theoretic perspective on optimal high-order optimization (Q2089793) (← links)
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition (Q2089864) (← links)
- Convergence to equilibrium for time and space discretizations of the Cahn-Hilliard equation (Q2090471) (← links)
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem (Q2181667) (← links)
- An extension of the second order dynamical system that models Nesterov's convex gradient method (Q2232772) (← 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)
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry (Q2687067) (← 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)
- Optimisation and asymptotic stability (Q4561189) (← links)
- On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) (← links)
- Convergence Rates of Inertial Forward-Backward Algorithms (Q4609474) (← links)
- (Q4995610) (← links)
- Convergence Rates of the Heavy Ball Method for Quasi-strongly Convex Optimization (Q5097013) (← 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)
- Optimal Convergence Rates for Nesterov Acceleration (Q5206941) (← links)
- A second-order dynamical approach with variable damping to nonconvex smooth minimization (Q5210852) (← links)
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics (Q5233105) (← links)
- Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
- A numerical damped oscillator approach to constrained Schrödinger equations (Q6046434) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
- Fast optimization via inertial dynamics with closed-loop damping (Q6172672) (← links)