Improved low-rank matrix approximation in multivariate case

DOI10.1142/S0219876224500440MaRDI QIDQ6955471zbMATH OpenFDO

Authors Pichid Kittisuwan, Prayoot Akkaraekthalin

Publication date 22 July 2025

Published in International Journal of Computational Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0219876224500440

zbMATH Keywords

Frobenius normlow-rank matrix approximationregularizer (penalty function)

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites work

• A low-rank matrix approach to compute polynomial approximations of smooth two-dimensional functions
• Divide and Conquer: A Quick Scheme for Symbolic Regression
• Fast singular value thresholding without singular value decomposition
• Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization
• scientific article; zbMATH DE number 823379 (Why is no real title available?)
• Robust principal component analysis?
• Sparse Signal Estimation by Maximally Sparse Convex Optimization
• The Optimal Hard Threshold for Singular Values is <inline-formula> <tex-math notation="TeX">\(4/\sqrt {3}\) </tex-math></inline-formula>

This page was built for publication: Improved low-rank matrix approximation in multivariate case

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