Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems
From MaRDI portal
Publication:6579998
Recommendations
- First order inertial optimization algorithms with threshold effects associated with dry friction
- First-order inertial algorithms involving dry friction damping
- Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
Cites work
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A differential equation for modeling Nesterov's accelerated gradient method: theory and insights
- A note on the dynamics of an oscillator in the presence of strong friction.
- Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method
- Benchmarking optimization software with performance profiles.
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Convergence Conditions for Ascent Methods
- Finite convergence of proximal-gradient inertial algorithms combining dry friction with Hessian-driven damping
- Finite-time stabilization of continuous inertial dynamics combining dry friction with Hessian-driven damping
- First-order inertial algorithms involving dry friction damping
- Fixed-Time Gradient Dynamics With Time-Varying Coefficients for Continuous-Time Optimization
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Minimization of functions having Lipschitz continuous first partial derivatives
- On damped second-order gradient systems
- On gradients of functions definable in o-minimal structures
- On the nonmonotone line search
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal gradient method with extrapolation and line search for a class of non-convex and non-smooth problems
- Some methods of speeding up the convergence of iteration methods
- Sparse Reconstruction by Separable Approximation
Cited in
(2)
This page was built for publication: Fast gradient algorithm with dry-like friction and nonmonotone line search for nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6579998)
