ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1711.04489
  4. Cited By
A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex
  Sparsity-Regularized Rank Minimization

A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization

13 November 2017
Yang Yang
M. Pesavento
ArXivPDFHTML

Papers citing "A Parallel Best-Response Algorithm with Exact Line Search for Nonconvex Sparsity-Regularized Rank Minimization"

3 / 3 papers shown
Title
Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to
  Unveiling Traffic Anomalies
Recovery of Low-Rank Plus Compressed Sparse Matrices with Application to Unveiling Traffic Anomalies
Morteza Mardani
Gonzalo Mateos
G. Giannakis
138
95
0
30 Apr 2012
In-network Sparsity-regularized Rank Minimization: Algorithms and
  Applications
In-network Sparsity-regularized Rank Minimization: Algorithms and Applications
Morteza Mardani
Gonzalo Mateos
G. Giannakis
72
76
0
07 Mar 2012
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear
  Norm Minimization
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Benjamin Recht
Maryam Fazel
P. Parrilo
416
3,766
0
28 Jun 2007
1