EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution

Hedy Attouch, Szilárd Csaba László

Mathematical Methods of Operations Research · 2024-06 · 99 (3) · 307-347

DOI: 10.1007/s00186-024-00867-y ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Methods of Operations Research, online erschienen am 27.06.2024. Verfasst von Hedy Attouch und 1 weiteren Autor:innen. Die Arbeit wurde bisher 20-mal zitiert (Crossref) und nennt 44 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: CNCS-UEFISCDI.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In a Hilbertian framework, for the minimization of a general convex differentiable function f , we introduce new inertial dynamics and algorithms that generate trajectories and iterates that converge fastly towards the minimizer of f with minimum norm. Our study is based on the non-autonomous version of the Polyak heavy ball method, which, at time t , is associated with the strongly convex function obtained by adding to f a Tikhonov regularization term with vanishing coefficient $$\varepsilon (t)$$ ε ( t ) . In this dynamic, the damping coefficient is proportional to the square root of the Tikhonov regularization parameter $$\varepsilon (t)$$ ε ( t ) . By adjusting the speed of convergence of $$\varepsilon (t)$$ ε ( t ) towards zero, we will obtain both rapid convergence towards the infimal value of f , and the strong convergence of the trajectories towards the element of minimum norm of the set of minimizers of f . In particular, we obtain an improved version of the dynamic of Su-Boyd-Candès for the accelerated gradient method of Nesterov. This study naturally leads to corresponding first-order algorithms obtained by temporal discretization. In the case of a proper lower semicontinuous and convex function f , we study the proximal algorithms in detail, and show that they benefit from similar properties.

Förderung

  • CNCS-UEFISCDI

Zitieren

APA

Attouch, H., & László, S. C. (2024). Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution. Mathematical Methods of Operations Research, 99(3), 307-347. https://doi.org/10.1007/s00186-024-00867-y

Vancouver

Attouch H, László SC. Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution. Mathematical Methods of Operations Research. 2024;99(3):307-347. doi:10.1007/s00186-024-00867-y

BibTeX
@article{Attouch2024,
  author = {Attouch, Hedy and László, Szilárd Csaba},
  title = {Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution},
  journal = {Mathematical Methods of Operations Research},
  year = {2024},
  volume = {99},
  number = {3},
  pages = {307--347},
  doi = {10.1007/s00186-024-00867-y}
}
Kostenlos starten →