Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm - Archive ouverte HAL Access content directly
Journal Articles IEEE Signal Processing Letters Year : 2016

Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm

Abstract

State-of-the-art methods for solving smooth optimization problems are nonlinear conjugate gradient, low memory BFGS, and majorize-minimize (MM) subspace algorithms. The MM subspace algorithm that has been introduced more recently has shown good practical performance when compared with other methods on various optimization problems arising in signal and image processing. However, to the best of our knowledge, no general result exists concerning the theoretical convergence rate of the MM subspace algorithm. This paper aims at deriving such convergence rates both for batch and online versions of the and in particular, discusses the influence of the choice of the subspace.
Fichier principal
Vignette du fichier
ARXIV_3MGrate_v3.pdf (159.29 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01373641 , version 1 (24-10-2016)

Licence

Copyright

Identifiers

Cite

Emilie Chouzenoux, Jean-Christophe Pesquet. Convergence Rate Analysis of the Majorize-Minimize Subspace Algorithm. IEEE Signal Processing Letters, 2016, 23 (9), pp.1284 - 1288. ⟨10.1109/LSP.2016.2593589⟩. ⟨hal-01373641⟩
204 View
329 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More