Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients
From MaRDI portal
Recommendations
- Deriving efficient optimization methods based on stable explicit numerical methods
- Essential convergence rate of ordinary differential equations appearing in optimization
- A convergence of ODE method in constrained optimization
- Convergence rate of gradient-concordant methods for smooth unconstrained optimization
- Analysis of continuous dynamical system models with Hessians derived from optimization methods
Cites work
- A Lyapunov analysis of accelerated methods in optimization
- A new class of energy-preserving numerical integration methods
- A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization
- First-order optimization algorithms via inertial systems with Hessian driven damping
- Geometric Numerical Integration
- Hamiltonian-conserving discrete canonical equations based on variational difference quotients
- Lectures on convex optimization
- Solving Ordinary Differential Equations I
- Time integration and discrete Hamiltonian systems
Cited in
(2)
This page was built for publication: Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559452)