A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

DOI10.1109/TSP.2018.2870353MaRDI QIDQ4622478zbMATH OpenOpenAlexFDO

Authors Ya-Ping Hsieh, Yu-Chun Kao, Rabeeh Karimi Mahabadi, A. Yurtsever, Anastasios Kyrillidis, Volkan Cevher

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

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(7)

• Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems
• Two-step inertial Bregman alternating minimization algorithm for nonconvex and nonsmooth problems
• A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization
• Nonconvex Matrix Factorization From Rank-One Measurements
• Manifold Regularized Discriminative Nonnegative Matrix Factorization With Fast Gradient Descent
• Two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
• Alternative gradient algorithms with applications to nonnegative matrix factorizations

This page was built for publication: A Non-Euclidean Gradient Descent Framework for Non-Convex Matrix Factorization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4622478)