An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation
From MaRDI portal
Publication:2666090
Recommendations
- An extension of the second order dynamical system that models Nesterov's convex gradient method
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- Optimized first-order methods for smooth convex minimization
- First-order optimization algorithms via inertial systems with Hessian driven damping
- An optimized implementation of the Newmark/Newton‐Raphson algorithm for the time integration of non‐linear problems
Cites work
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- Adaptive restart for accelerated gradient schemes
- Adjoint method in the sensitivity analysis of optimal systems
- Alternating minimization as sequential unconstrained minimization: a survey
- An FFT-based fast gradient method for elastic and inelastic unit cell homogenization problems
- Discrete material optimization of general composite shell structures
- Efficient first-order methods for convex minimization: a constructive approach
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 4033243 (Why is no real title available?)
- scientific article; zbMATH DE number 3557389 (Why is no real title available?)
- scientific article; zbMATH DE number 1497417 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Introductory lectures on convex optimization. A basic course.
- Methods of conjugate gradients for solving linear systems
- Modified two-point stepsize gradient methods for unconstrained optimization
- Nesterov-aided stochastic gradient methods using Laplace approximation for Bayesian design optimization
- Nonlinear finite element methods
- Some methods of speeding up the convergence of iteration methods
- Testing Unconstrained Optimization Software
- Two-Point Step Size Gradient Methods
Cited in
(5)- The application of Goeken-Johnson's Runge-Kutta methods in unconstrained convex optimization
- Application of the modified Runge-Kutta method to the construction of the descent method for solving boundary value problems
- Gradient methods based on non-standard Lagrange-Burmann Runge-Kutta method
- On the application of explicit Runge-Kutta methods to the construction of stochastic gradient descent methods for convex optimization
- Application of stochastic gradient method with momentum inspired by explicit stabilized Runge-Kutta method in unconstrained convex optimization
This page was built for publication: An engineering interpretation of Nesterov's convex minimization algorithm and time integration: application to optimal fiber orientation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2666090)
