Cover Image

Efficient Low Rank Matrix Recovery With Flexible Group Sparse Regularization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yu, Quan, Bai, Minru, Zhang, Xinzhen
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multi-Tubal Rank of Third Order Tensor and Related Low Rank Tensor Completion Problem
by: Yu, Quan, et al.
Published: (2020)

Tensor factorization based method for low rank matrix completion and its application on tensor completion
by: Yu, Quan, et al.
Published: (2022)

An ideal-sparse generalized moment problem reformulation for completely positive tensor decomposition exploiting maximal cliques of multi-hypergraphs
by: Huang, Pengfei, et al.
Published: (2025)

Reweighted Quasi Norm Regularized Low-Rank Factorization for Matrix Robust PCA
by: Qin, Zhenzhi, et al.
Published: (2024)

An accelerated semi-proximal ADMM with applications to multi-block sparse optimization problems
by: Liu, Peng, et al.
Published: (2025)

A smoothing proximal gradient algorithm for matrix rank minimization problem
by: Yu, Quan, et al.
Published: (2021)

Zeroth-order Low-rank Hessian Estimation via Matrix Recovery
by: Wang, Tianyu, et al.
Published: (2024)

Projected Gradient Descent Algorithm for Low-Rank Matrix Estimation
by: Zhang, Teng, et al.
Published: (2024)

Exact Sparse Representation Recovery in Signal Demixing and Group BLASSO
by: Carioni, Marcello, et al.
Published: (2024)

Spectral-Spatial Extraction through Layered Tensor Decomposition for Hyperspectral Anomaly Detection
by: Yu, Quan, et al.
Published: (2025)

An Efficient ADMM Method for Ratio-Type Nonconvex and Nonsmooth Minimization in Sparse Recovery
by: Yu, Lang, et al.
Published: (2025)

A Hybrid Registration and Fusion Method for Hyperspectral Super-resolution
by: Yang, Kunjing, et al.
Published: (2024)

A Single-Mode Quasi Riemannian Gradient Descent Algorithm for Low-Rank Tensor Recovery
by: Zhang, Yuanwei, et al.
Published: (2024)

A Smoothing Newton Method for Rank-one Matrix Recovery
by: Maunu, Tyler, et al.
Published: (2025)

Low-Rank Extragradient Method for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Low-Rank Mirror-Prox for Nonsmooth and Low-Rank Matrix Optimization Problems
by: Garber, Dan, et al.
Published: (2022)

Efficient Group Lasso Regularized Rank Regression with Data-Driven Parameter Determination
by: Lin, Meixia, et al.
Published: (2025)

Group Distributionally Robust Optimization with Flexible Sample Queries
by: Bai, Haomin, et al.
Published: (2025)

Heaviside Low-Rank Support Matrix Machine
by: Xiu, Xianchao, et al.
Published: (2026)

Nonnegative Low-rank Matrix Recovery Can Have Spurious Local Minima
by: Zhang, Richard Y.
Published: (2025)

Sparse Polynomial Optimization with Matrix Constraints
by: Nie, Jiawang, et al.
Published: (2024)

Proximal Iterative Hard Thresholding Algorithm for Sparse Group $\ell_0$-Regularized Optimization with Box Constraint
by: Ye, Yuge, et al.
Published: (2025)

SLRQA: A Sparse Low-Rank Quaternion Model for Color Image Processing with Convergence Analysis
by: Deng, Zhanwang, et al.
Published: (2024)

Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent
by: Liu, Zhiyu, et al.
Published: (2024)

Efficient Recovery of Sparse Graph Signals from Graph Filter Outputs
by: Morgenstern, Gal, et al.
Published: (2024)

Iterative Regularization with k-support Norm: An Important Complement to Sparse Recovery
by: de Vazelhes, William, et al.
Published: (2023)

A Note On the Rank of the Optimal Matrix in Symmetric Toeplitz Matrix Completion Problem
by: Yan, Xihong, et al.
Published: (2019)

Disjunctive Branch-and-Bound for Certifiably Optimal Low-Rank Matrix Completion
by: Bertsimas, Dimitris, et al.
Published: (2023)

Can Learning Be Explained By Local Optimality In Robust Low-rank Matrix Recovery?
by: Ma, Jianhao, et al.
Published: (2023)

Sparse Recovery via $\ell_p^p/\ell_q^p$ Ratio Minimization: Theory and Algorithm
by: Yu, Lang, et al.
Published: (2026)

Structured Gradient Descent for Fast Robust Low-Rank Hankel Matrix Completion
by: Cai, HanQin, et al.
Published: (2022)

Guarantees of a Preconditioned Subgradient Algorithm for Overparameterized Asymmetric Low-rank Matrix Recovery
by: Giampouras, Paris, et al.
Published: (2024)

Sparse Recovery: The Square of $\ell_1/\ell_2$ Norms
by: Jia, Jianqing, et al.
Published: (2024)

Efficient Alternating Minimization with Applications to Weighted Low Rank Approximation
by: Song, Zhao, et al.
Published: (2023)

The Power of Preconditioning in Overparameterized Low-Rank Matrix Sensing
by: Xu, Xingyu, et al.
Published: (2023)

Log-Sum Regularized Kaczmarz Algorithms for High-Order Tensor Recovery
by: Henneberger, Katherine, et al.
Published: (2023)

Unlabeled Sensing Using Rank-One Moment Matrix Completion
by: Liang, Hao, et al.
Published: (2024)

SPP-SBL: Space-Power Prior Sparse Bayesian Learning for Block Sparse Recovery
by: Zhang, Yanhao, et al.
Published: (2025)

Hearing the Shape of a Cuboid Room Using Sparse Measure Recovery
by: Deleforge, Antoine, et al.
Published: (2025)

Q3R: Quadratic Reweighted Rank Regularizer for Effective Low-Rank Training
by: Ghosh, Ipsita, et al.
Published: (2025)