In this work, we focus on separable convex optimization prob- lems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of iterations. This allows us to bridge the gap between a wide family of power allocation problems of practical interest in signal pro- cessing and communications and their efficient implementa- tion in practice.
Convex separable problems with linear and box constraints
D'AMICO, ANTONIO ALBERTO;SANGUINETTI, LUCA;
2014-01-01
Abstract
In this work, we focus on separable convex optimization prob- lems with linear and box constraints and compute the solution in closed-form as a function of some Lagrange multipliers that can be easily computed in a finite number of iterations. This allows us to bridge the gap between a wide family of power allocation problems of practical interest in signal pro- cessing and communications and their efficient implementa- tion in practice.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
