Deriving efficient optimization methods based on stable explicit numerical methods
From MaRDI portal
Recommendations
- Essential convergence rate of ordinary differential equations appearing in optimization
- A gradient-based continuous method for large-scale optimization problems
- A convergence of ODE method in constrained optimization
- Derivation of high order efficient numerical methods fory’=f(x, y) – A constrained optimization problem
- scientific article; zbMATH DE number 5225953
Cites work
- A class of methods for unconstrained minimization based on stable numerical integration techniques
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- Explicit Runge-Kutta methods for parabolic partial differential equations
- scientific article; zbMATH DE number 940566 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Some effective methods for unconstrained optimization based on the solution of systems of ordinary differential equations
- Utilization of ordered chebyshev parameters in iterative methods
Cited in
(6)- Stabilized optimization via an NCL algorithm
- A gradient-based continuous method for large-scale optimization problems
- Derivation of high order efficient numerical methods fory’=f(x, y) – A constrained optimization problem
- Essential convergence rate of ordinary differential equations appearing in optimization
- From numerical optimization method to learning optimization method
- Properties and practicability of convergence-guaranteed optimization methods derived from weak discrete gradients
This page was built for publication: Deriving efficient optimization methods based on stable explicit numerical methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5047119)
