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

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.
9781479928934
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.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11568/520072
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 0
social impact