DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks
DOI10.1007/978-3-319-17996-4_5zbMATH Open1351.90133OpenAlexW1182568510MaRDI QIDQ2808070FDOQ2808070
Pham Thi Hoai, Nam Nguyen Canh, Tran van Huy
Publication date: 26 May 2016
Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17996-4_5
Nonconvex programming, global optimization (90C26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Boolean programming (90C09)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Exact penalty and error bounds in DC programming
Cited In (2)
This page was built for publication: DC Programming and DCA Approach for Resource Allocation Optimization in OFDMA/TDD Wireless Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2808070)
