Geometric Programming for Communication Systems
From MaRDI portal
Publication:5898665
DOI10.1561/0100000005zbMath1133.90006OpenAlexW4297970685MaRDI QIDQ5898665
Publication date: 23 February 2007
Published in: Foundations and Trends® in Communications and Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/87859eb10639de37b862ec1d7800436c39e38d69
Communication networks in operations research (90B18) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Mathematical programming (90Cxx)
Related Items (15)
Data fitting with geometric-programming-compatible softmax functions ⋮ Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms ⋮ A Lagrange duality approach for multi-composed optimization problems ⋮ Sparse identification of posynomial models ⋮ An efficient DCA based algorithm for power control in large scale wireless networks ⋮ Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions ⋮ Robust chance-constrained geometric programming with application to demand risk mitigation ⋮ Hyperloop system optimization ⋮ Robust budget allocation via continuous submodular functions ⋮ DC Programming and DCA for a Novel Resource Allocation Problem in Emerging Area of Cooperative Physical Layer Security ⋮ Disciplined geometric programming ⋮ Tropical varieties for exponential sums ⋮ Information-based measure of nonlocality
This page was built for publication: Geometric Programming for Communication Systems
