EnglishIn 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.
| Titolo: | Convex separable problems with linear and box constraints |
| Autori: | |
| Anno del prodotto: | 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. |
| Handle: | http://hdl.handle.net/11568/520072 |
| ISBN: | 9781479928934 |
| Appare nelle tipologie: | 4.1 Contributo in Atti di convegno |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Utilizza questo identificativo per citare o creare un link a questo documento:
http://hdl.handle.net/11568/520072
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Copyright © 2019