A Proximal-Proximal Majorization-Minimization Algorithm for Nonconvex Rank Regression Problems

In this paper, we introduce a proximal-proximal majorization-minimization (PPMM) algorithm for nonconvex rank regression problems. The basic idea of the algorithm is to apply the proximal majorization-minimization algorithm to solve the nonconvex problem with the inner subproblems solved by a sparse...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on signal processing Jg. 71; S. 3502 - 3517
Hauptverfasser:	Tang, Peipei, Wang, Chengjing, Jiang, Bo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation algorithms Convergence Criteria Linear programming Minimization Nonconvex rank regression problems Optimization proximal point algorithm proximal-proximal majorization-minimization algorithm Regularization semismooth Newton method Signal processing algorithms Urban areas
ISSN:	1053-587X, 1941-0476
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!