Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
DOI10.1016/J.COR.2011.01.002zbMATH Open1208.90127OpenAlexW2024447372MaRDI QIDQ632686FDOQ632686
Authors: Pablo Adasme, Abdel Lisser, Ismael Soto 
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.002
Recommendations
- Semidefinite and conic programming for robust wireless OFDMA networks
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- A two stage stochastic semidefinite relaxation for wireless OFDMA networks
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- Semidefinite approximation for mixed binary quadratically constrained quadratic programs
semidefinite programmingresource allocationrobust optimizationbinary quadratically constrained quadratic programsorthogonal division multiple access
Quadratic programming (90C20) Semidefinite programming (90C22) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- CSDP, A C library for semidefinite programming
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- The Price of Robustness
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust solutions of uncertain linear programs
- Robust discrete optimization and its applications
- Robust solutions of linear programming problems contaminated with uncertain data
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
- Robust convex optimization
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Robust Solutions to Uncertain Semidefinite Programs
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- A semidefinite programming approach to the quadratic knapsack problem
- L’algebre de Boole et ses applications en recherche operationnelle
Cited In (10)
- Semidefinite and conic programming for robust wireless OFDMA networks
- A quadratic semidefinite relaxation approach for resource allocation in orthogonal frequency division multiple access
- Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks
- Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks
- A computational study for bilevel quadratic programs using semidefinite relaxations
- Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
- Title not available (Why is that?)
- A two stage stochastic semidefinite relaxation for wireless OFDMA networks
- A Dual Perspective on Separable Semidefinite Programming With Applications to Optimal Downlink Beamforming
- Lagrangian dual decomposition for joint resource allocation optimization problem in OFDMA downlink networks
Uses Software
This page was built for publication: Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632686)
