Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization

We introduce and analyze BPALM and A-BPALM, two multi-block proximal alternating linearized minimization algorithms using Bregman distances for solving structured nonconvex problems. The objective function is the sum of a multi-block relatively smooth function (i.e., relatively smooth by fixing all...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2019-10
Hauptverfasser:	Ahookhosh, Masoud, Le Thi Khanh Hien, Gillis, Nicolas, Patrinos, Panagiotis
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer Science - Numerical Analysis Convergence Critical point Factorization Linearization Mathematics - Numerical Analysis Mathematics - Optimization and Control Nonlinear programming Optimization
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!