Geometric Programming for Communication Systems
From MaRDI portal
Recommendations
Cited in
(21)- Sparse identification of posynomial models
- Two optimization problems in wireless communication system design and related optimization methods
- Geometric programming problems with triangular and trapezoidal twofold uncertainty distributions
- Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
- Robust chance-constrained geometric programming with application to demand risk mitigation
- A level-set method for convex optimization with a feasible solution path
- Communication aspects of networks based on geometric incidence relations
- Robust budget allocation via continuous submodular functions
- Disciplined geometric programming
- Information-based measure of nonlocality
- Geometric Programming for Communication Systems
- An efficient DCA based algorithm for power control in large scale wireless networks
- Hyperloop system optimization
- DC programming and DCA for a novel resource allocation problem in emerging area of cooperative physical layer security
- Monotonic optimization in communication and networking systems
- Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms
- A geometric programming approach to solve the restricted assignment case of the Santa Claus problem
- scientific article; zbMATH DE number 3850817 (Why is no real title available?)
- Tropical varieties for exponential sums
- A Lagrange duality approach for multi-composed optimization problems
- Data fitting with geometric-programming-compatible softmax functions
This page was built for publication: Geometric Programming for Communication Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5898665)