Newton-like dynamics associated to nonconvex optimization problems
From MaRDI portal
Abstract: We consider the dynamical system �egin{equation*}left{ �egin{array}{ll} v(t)inpartialphi(x(t))\ lambdadot x(t) + dot v(t) + v(t) +
abla psi(x(t))=0, end{array}
ight.end{equation*} where is a proper, convex and lower semicontinuous function, is a (possibly nonconvex) smooth function and is a parameter which controls the velocity. We show that the set of limit points of the trajectory is contained in the set of critical points of the objective function , which is here seen as the set of the zeros of its limiting subdifferential. If the objective function satisfies the Kurdyka-L{}ojasiewicz property, then we can prove convergence of the whole trajectory to a critical point. Furthermore, convergence rates for the orbits are obtained in terms of the L{}ojasiewicz exponent of the objective function, provided the latter satisfies the L{}ojasiewicz property.
Recommendations
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
Cited in
(10)- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- Levenberg-Marquardt dynamics associated to variational inequalities
- Convergence rates for the heavy-ball continuous dynamics for non-convex optimization, under Polyak-Łojasiewicz condition
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- Accelerated differential inclusion for convex optimization
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Finite-time nonconvex optimization using time-varying dynamical systems
- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
- On the dynamics of a differential inclusion built upon a nonconvex constrained minimization problem
This page was built for publication: Newton-like dynamics associated to nonconvex optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319938)