On the Convergence of Block Majorization-Minimization Algorithms on the Grassmann Manifold

The Majorization-Minimization (MM) framework is widely used to derive efficient algorithms for specific problems that require the optimization of a cost function (which can be convex or not). It is based on a sequential optimization of a surrogate function over closed convex sets. A natural extensio...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE signal processing letters Vol. 31; pp. 1314 - 1318
Main Authors:	Lopez, Carlos Alejandro, Riba, Jaume
Format:	Journal Article
Language:	English
Published:	New York IEEE 2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Constraints Convergence Convexity Cost function geodesically convex optimization Grassmann manifold Independent variables majorization-minimization Manifolds Manifolds (mathematics) Minimization Non-convex optimization Optimization Principal component analysis Riemannian optimization Signal processing Signal processing algorithms
ISSN:	1070-9908, 1558-2361
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!