Convex Separable Problems With Linear Constraints in Signal Processing and Communications

DOI10.1109/TSP.2014.2360143zbMath1394.94142arXiv1407.4477OpenAlexW1996840846MaRDI QIDQ4579589

Antonio Alberto D'Amico, Luca Sanguinetti, Daniel P. Palomar

Publication date: 22 August 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.4477

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (6)

Algorithms for separable convex optimization with linear ascending constraints ⋮ Distributed resource allocation over random networks based on stochastic approximation ⋮ Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph ⋮ On solving convex optimization problems with linear ascending constraints

This page was built for publication: Convex Separable Problems With Linear Constraints in Signal Processing and Communications