The sparsest solution of the union of finite polytopes via its nonconvex relaxation
Year of publication: |
2019
|
---|---|
Authors: | You, Guowei ; Huang, Zheng-Hai ; Wang, Yong |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 89.2019, 3, p. 485-507
|
Subject: | Nonconvex relaxation | Sparse optimization | Sparse solution | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Sparse solutions by a quadratically constrained q (0 < q < 1) minimization model
Jiang, Shan, (2021)
-
DC approximation approaches for sparse optimization
Thi, H. A. Le, (2015)
-
On the minimization over sparse symmetric sets : projections, optimality conditions, and algorithms
Beck, Amir, (2016)
- More ...
-
Liu, Xiao-hong, (2009)
-
Polynomial time solvability of non-symmetric semidefinite programming
Hu, Shenglong, (2010)
-
Liu, Xiao-Hong, (2009)
- More ...