560 search results - page 16 / 112 » Level-set methods for convex optimization |
105
click to vote
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
106
click to vote
AUTOMATICA
2007
15 years 2 months ago
2007
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
142
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider a class of learning problems regularized by a structured sparsity-inducing norm defined as the sum of 2- or ∞-norms over groups of variables. Whereas much effort ha...
145
Voted
SIAMIS
2010
14 years 8 months ago
2010
We generalize the primal-dual hybrid gradient (PDHG) algorithm proposed by Zhu and Chan in [M. Zhu, and T. F. Chan, An Efficient Primal-Dual Hybrid Gradient Algorithm for Total Var...
102
click to vote
ESA
2010
Springer
15 years 3 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...