Search Results for author:
Found 3 papers, 0 papers with code
Improved Sparse Low-Rank Matrix Estimation
Further, we show how to set the parameters of the non-convex penalty functions, in order to ensure that the objective function is strictly convex.
Enhanced Low-Rank Matrix Approximation
This letter proposes to estimate low-rank matrices by formulating a convex optimization problem with non-convex regularization.
Convex Denoising using Non-Convex Tight Frame Regularization
To more accurately estimate non-zero values, we propose the use of a non-convex regularizer, chosen so as to ensure convexity of the objective function.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
