activity
20162020
most citedMinimization of fraction function penalty in compressed sensing

45 citations · 52 across the 14 of their papers we have counts for

collaborators
Showing 2018Show all

5 papers · 1 filter

math.OC2018

A non-convex approach to low-rank and sparse matrix decomposition

Angang Cui, Meng Wen, Haiyang Li +1

In this paper, we develop a nonconvex approach to the problem of low-rank and sparse matrix decomposition. In our nonconvex method, we replace the rank function and the -nor…

math.OC2018★ 2 cited

Iterative thresholding algorithm based on non-convex method for modified lp-norm regularization minimization

Angang Cui, Jigen Peng, Haiyang Li +2

Recently, the -norm regularization minimization problem has attracted great attention in compressed sensing. However, the -norm in problem…

math.OC2018

A New Nonconvex Strategy to Affine Matrix Rank Minimization Problem

Angang Cui, Jigen Peng, Haiyang Li +2

The affine matrix rank minimization (AMRM) problem is to find a matrix of minimum rank that satisfies a given linear system constraint. It has many applications in some important a…

math.OC2018

Sparse Portfolio Selection via Non-convex Fraction Function

Angang Cui, Jigen Peng, Chengyi Zhang +2

In this paper, a continuous and non-convex promoting sparsity fraction function is studied in two sparse portfolio selection models with and without short-selling constraints. Firs…

math.OC2018★ 2 cited

Modified lp-norm regularization minimization for sparse signal recovery

Angang Cui, Jigen Peng, Haiyang Li

In numerous substitution models for the -norm minimization problem , the -norm minimization with have been considered as the most natural c…