Constructing new weighted l1-algorithms for the sparsest points of polyhedral sets
Year of publication: |
February 2017
|
---|---|
Authors: | Zhao, Yun-Bin ; Luo, Zhi-Quan |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 42.2017, 1, p. 57-76
|
Subject: | polyhedral set | sparsest point | weighted l1-algorithm | convex optimization | sparsity recovery | strict complementarity | duality theory | bilevel programming | Mathematische Optimierung | Mathematical programming | Theorie | Theory |
-
Primal-dual interior-point methods for domain-driven formulations
Karimi, Mehdi, (2020)
-
Genericity results in linear conic programming : a tour d'horizon
Dür, Mirjam, (2017)
-
Synthetic control method with convex hull restrictions : a Bayesian maximum a posteriori approach
Goh, Gyuhyeong, (2022)
- More ...
-
Weak stability of ℓ1-minimization methods in sparse data reconstruction
Zhao, Yun-Bin, (2019)
-
On the proximal Landweber Newton method for a class of nonsmooth convex problems
Zhang, Hai-Bin, (2015)
-
On a New Homotopy Continuation Trajectory for Nonlinear Complementarity Problems
Zhao, Yun-Bin, (2001)
- More ...