Convex Separable Problems With Linear Constraints in Signal Processing and Communications
From MaRDI portal
Abstract: In this work, we focus on separable convex optimization problems with box constraints and a set of triangular 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 retain some of the intuition spelled out by the water-filling policy. It turns out that it is not only general enough to compute the solution to different instances of the problem at hand but also remarkably simple in the way it operates. We also show how some power allocation problems in signal processing and communications can be solved with the proposed algorithm.
Cited in
(9)- Algorithms for separable convex optimization with linear ascending constraints
- Distributed resource allocation over random networks based on stochastic approximation
- On solving convex optimization problems with linear ascending constraints
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- A Unitarily Constrained Total Least Squares Problem in Signal Processing
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- On a Reduction for a Class of Resource Allocation Problems
- Advances in Neural Networks – ISNN 2005
- Single-machine scheduling with controllable processing times: a complexity dichotomy and a faster algorithm
This page was built for publication: Convex Separable Problems With Linear Constraints in Signal Processing and Communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4579589)
