Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme

DOI10.1016/j.cor.2011.01.002zbMath1208.90127OpenAlexW2024447372MaRDI QIDQ632686

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

zbMATH Keywords

semidefinite programmingresource allocationrobust optimizationbinary quadratically constrained quadratic programsorthogonal division multiple access

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31)

Related Items

Uplink scheduling for joint wireless orthogonal frequency and time division multiple access networks ⋮ A computational study for bilevel quadratic programs using semidefinite relaxations ⋮ Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme ⋮ Stochastic and semidefinite optimization for scheduling in orthogonal frequency division multiple access networks ⋮ Unnamed Item

Uses Software

• CSDP
• Mosek

Cites Work

• Unnamed Item
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme
• Geometric algorithms and combinatorial optimization
• Robust solutions of uncertain linear programs
• Robust discrete optimization and its applications
• A semidefinite programming approach to the quadratic knapsack problem
• Robust solutions of linear programming problems contaminated with uncertain data
• Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs
• Robust Convex Optimization
• The Price of Robustness
• L’algebre de Boole et ses applications en recherche operationnelle
• Cones of Matrices and Set-Functions and 0–1 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
• Robust Solutions to Least-Squares Problems with Uncertain Data
• CSDP, A C library for semidefinite programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming