A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm.

Miguel Carrasco*, Karine Pichard

*Autor correspondiente de este trabajo

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

Resumen

In this note, an inertial and relaxed version of a diagonal hybrid projection-proximal point algorithm is considered, in order to find the minimum of a function f approximated by a sequence of functions (in general, smoother than f or taking into account some constraints of the problem). Two convergence theorems are proved under different kind of assumptions, which allows to apply the method in various cases.
Idioma originalInglés
Páginas (desde-hasta)561-574
Número de páginas14
PublicaciónOptimization
Volumen59
N.º4
DOI
EstadoPublicada - may. 2010

Huella

Profundice en los temas de investigación de 'A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm.'. En conjunto forman una huella única.

Citar esto