Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints

Authors:
Amir Beck;Yonina C. Eldar
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
2006

Citing 0
Cited 13

On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls

Journal of Global Optimization
Rethinking Biased Estimation: Improving Maximum Likelihood and the Cramér–Rao Bound

Foundations and Trends in Signal Processing
Robust linear MIMO in the downlink: a worst-case optimization with ellipsoidal uncertainty regions

EURASIP Journal on Advances in Signal Processing
Energy-efficient multiuser SIMO: achieving probabilistic robustness with Gaussian channel uncertainty

IEEE Transactions on Communications
Robust collaborative-relay beamforming

IEEE Transactions on Signal Processing
Adaptive detection and estimation in the presence of useful signal and interference mismatches

IEEE Transactions on Signal Processing
Robust cognitive beamforming with bounded channel uncertainties

IEEE Transactions on Signal Processing
Regularized Lagrangian duality for linearly constrained quadratic optimization and trust-region problems

Journal of Global Optimization
Structured Total Maximum Likelihood: An Alternative to Structured Total Least Squares

SIAM Journal on Matrix Analysis and Applications
On zero duality gap in nonconvex quadratic programming problems

Journal of Global Optimization
Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets

Journal of Global Optimization
SDP reformulation for robust optimization problems based on nonconvex QP duality

Computational Optimization and Applications
Optimal Precoder Design for Non-Regenerative MIMO Cognitive Two-Way Relay Systems with Underlay Spectrum Sharing

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider the problem of minimizing an indefinite quadratic function subject to two quadratic inequality constraints. When the problem is defined over the complex plane we show that strong duality holds and obtain necessary and sufficient optimality conditions. We then develop a connection between the image of the real and complex spaces under a quadratic mapping, which together with the results in the complex case lead to a condition that ensures strong duality in the real setting. Preliminary numerical simulations suggest that for random instances of the extended trust region subproblem, the sufficient condition is satisfied with a high probability. Furthermore, we show that the sufficient condition is always satisfied in two classes of nonconvex quadratic problems. Finally, we discuss an application of our results to robust least squares problems.