A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization
From MaRDI portal
Publication:4622478
DOI10.1109/TSP.2018.2870353zbMath1415.94129OpenAlexW2766863567MaRDI QIDQ4622478
Volkan Cevher, A. Yurtsever, Ya-Ping Hsieh, Rabeeh Karimi Mahabadi, Anastasios Kyrillidis, Yu-Chun Kao
Publication date: 12 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tsp.2018.2870353
Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (3)
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems ⋮ A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization ⋮ Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
This page was built for publication: A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization
