Skip to Main content Skip to Navigation
Journal articles

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.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01373641
Contributor : Emilie Chouzenoux <>
Submitted on : Monday, October 24, 2016 - 11:48:45 AM
Last modification on : Wednesday, April 8, 2020 - 4:11:57 PM

File

ARXIV_3MGrate_v3.pdf
Files produced by the author(s)

Licence


Copyright

Identifiers

Citation

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

Share

Metrics

Record views

535

Files downloads

307