Sparse Optimization
Sparse Optimization is a variational optimization method that specifically seeks solutions with minimal non-zero components, distinguishing itself by incorporating sparsity-inducingregularizers to promote structural simplicity in high-dimensional spaces.
1.4K
Publications
97K
Citations
3.2K
Authors
1K
Institutions
Publications per year
2017–2026
556
Parents
1.4K
Sparse Approximate Solutions to Linear Systems
B. K. Natarajan · SIAM Journal on Computing · 1995 · 2.8K citations
1–5 of 1.4K
3.2K
Rutgers, The State University of New Jersey, United States
11 publications · 1.2K citations
11
h-index
Institut national de recherche en sciences et technologies du numérique, France
10 publications · 1.4K citations
10
h-index
10
h-index
10
h-index
9
h-index
1–5 of 3.2K
1K

Xi'an Jiaotong University
Xi'an, China
20 h-index
77 publications
3.3K citations
Carnegie Mellon University
Pittsburgh, United States
20 h-index
44 publications
2.9K citations

University of Minnesota
Minneapolis, United States
19 h-index
45 publications
4.7K citations
University of California, Los Angeles
Los Angeles, United States
18 h-index
34 publications
2.2K citations
University of California, Berkeley
Berkeley, United States
18 h-index
29 publications
4.4K citations
Stanford University
Stanford, United States
18 h-index
44 publications
18.5K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
57 publications
1.8K citations

Chinese Academy of Sciences
Beijing, China
16 h-index
42 publications
3.1K citations
1–8 of 1K
Repository · 116 publications · 4.9K citations
31
h-index
40 publications · 4.8K citations
31
h-index
32 publications · 2.9K citations
21
h-index
24 publications · 2.4K citations
19
h-index
19 publications · 1.1K citations
17
h-index
1–5