116 search results - page 1 / 24 » Separable convex optimization problems with linear ascending... |
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
SIAMJO
2008
13 years 7 months ago
2008
A new active set algorithm for minimizing quadratic functions with separable convex constraints is proposed by combining the conjugate gradient method with the projected gradient. ...
TSP
2010
13 years 1 months ago
2010
This paper considers the downlink beamforming optimization problem that minimizes the total transmission power subject to global shaping constraints and individual shaping constrai...
EOR
2008
13 years 7 months ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
The 2- 1 compressed sensing minimization problem can be solved efficiently by gradient projection. In imaging applications, the signal of interest corresponds to nonnegative pixel...