Alternating minimization, proximal minimization and optimization transfer are equivalent
From MaRDI portal
Publication:4644030
Abstract: We show that proximal minimization algorithms (PMA), majorization minimization (MM), and alternating minimization (AM) are equivalent. Each type of algorithm leads to a decreasing sequence of objective function. New conditions on PMA are given (the limit of the decreasing sequence of objective function is indeed the infimum of the objective function), which lead to new conditions on AM for the sequence Phi to converge to its infimum. These conditions can then be translated into the language of MM. Examples are given of each type of algorithm and some open questions are posed.
Recommendations
Cited in
(5)- Auxiliary-function minimization algorithms
- scientific article; zbMATH DE number 2085383 (Why is no real title available?)
- scientific article; zbMATH DE number 1756451 (Why is no real title available?)
- A New Class of Alternating Proximal Minimization Algorithms with Costs-to-Move
- scientific article; zbMATH DE number 2110454 (Why is no real title available?)
This page was built for publication: Alternating minimization, proximal minimization and optimization transfer are equivalent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644030)