arXiv Analytics

Sign in

arXiv:1410.0641 [math.OC]AbstractReferencesReviewsResources

An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions

Radu Ioan Bot, Ernö Robert Csetnek, Szilárd László

Published 2014-10-02Version 1

We propose a forward-backward proximal-type algorithm with inertial/memory effects for minimizing the sum of a nonsmooth function with a smooth one in the nonconvex setting. The sequence of iterates generated by the algorithm converges to a critical point of the objective function provided an appropriate regularization of the objective satisfies the Kurdyka-\L{}ojasiewicz inequality, which is for instance fulfilled for semi-algebraic functions. We illustrate the theoretical results by considering two numerical experiments: the first one concerns the ability of recovering the local optimal solutions of nonconvex optimization problems, while the second one refers to the restoration of a noisy blurred image.

Comments: arXiv admin note: substantial text overlap with arXiv:1406.0724
Categories: math.OC, math.NA
Subjects: 90C26, 90C30, 65K10
Related articles: Most relevant | Search more
arXiv:1406.0724 [math.OC] (Published 2014-06-03)
An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
arXiv:2406.15793 [math.OC] (Published 2024-06-22)
Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds and convex constraints
arXiv:1703.01339 [math.OC] (Published 2017-03-03)
Newton-like dynamics associated to nonconvex optimization problems