Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms

Abstract

In this paper we carry out an asymptotic analysis of the proximal-gradient dynamical system equation*\ arrayll x(t) +x(t) = γ f[x(t)-γ∇(x(t))-ax(t)-by(t)],\\ y(t)+ax(t)+by(t)=0 array.equation* where f is a proper, convex and lower semicontinuous function, a possibly nonconvex smooth function and γ, a and b are positive real numbers. We show that the generated trajectories approach the set of critical points of f+, here understood as zeros of its limiting subdifferential, under the premise that a regularization of this sum function satisfies the Kurdyka-ojasiewicz property. We also establish convergence rates for the trajectories, formulated in terms of the ojasiewicz exponent of the considered regularization function.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…