Convex Separable Problems With Linear Constraints in Signal Processing and Communications

In this paper, we focus on separable convex optimization problems with box constraints and a specific set of linear constraints. The solution is given in closed-form as a function of some Lagrange multipliers that can be computed through an iterative procedure in a finite number of steps. Graphical interpretations are given casting valuable insights into the proposed algorithm and allowing to reta...