Abstract
In this paper, we discuss a kind of special nonconvex homogenous quadratic programming (HQP) and the methods to solve the HQP in an environment with certainty or uncertainty. In an environment with certainty, we first establish a strong duality between the HQP and its Lagrange dual problem, with the help of the fact that the Lagrange dual problem is equivalent to a convex semidefinite programming (SDP). Then we obtain a global solution to the HQP by solving the convex SDP. Furthermore, in an environment with uncertainty, we formulate the robust counterpart of the HQP to cope with uncertainty. We also establish the robust strong duality between the robust counterpart and its optimistic counterpart under a mild assumption. Since the counterpart is equivalent to a convex SDP under the same assumption, we can obtain a global solution to the robust counterpart by solving the convex SDP under the same assumption.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Goldsmith, A., Jafar, S.A., Jindal, N., Vishwanath, S.: Capacity limits of MIMO channels. IEEE J. Sel. Areas Commun. 21(5), 1437–1450 (2003)
Bengtsson, M., Ottersten, B.: Optimal and suboptimal transmit beamforming. In: Godara, L.C. (ed.) Chapter 18 in Handbook of Antennas in Wireless Communications. CRC Press (2001)
Wiesel, A., Eldar, Y.C., Shamai, S.: Linear precoding via conic optimization for fixed MIMO receivers. IEEE Trans. Signal Process. 54(1), 161–176 (2006)
Mutapcic, A., Kim, S.J., Boyd, S.: A tractable method for robust downlink beamforming in wireless communications. In: Proceedings of the IEEE Asilomar Conference on Signals, Systems and Computers, pp. 1224–1228. Pacific Grove, CA, USA (2007)
Song, E.B., Shi, Q.J., Sanjabi, M., Sun, R.Y., Luo, Z.Q.: Robust SINR-constrained MISO downlink beamform: when is semidefinte programming relaxation tight? In: ICASSP, pp. 3096–3099 (2011)
Luo, Z.Q., Ma, W.K., So, A.M.C., Ye, Y., Zhang, S.: Semidefinite relaxation of quadratic optimization problems. In: IEEE Signal Processing Magazine, Special issue on “Covex Opt. for SP”, pp. 20–34 (2010)
Luo, Z.Q., Chang, T.H.: SDP relaxation of homogeneous quadratic optimization: approximation bounds and applications. In: Palomar, D.P., Eldar, Y. (eds.) Chapter 4 in Convex Optimization in Signal Processing and Communications. Cambridge University, UK (2010)
Shapiro, A.: Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis. Psychometrika 47(2), 187–199 (1982)
Barvinok, A.I.: Problems of distance geometry and convex properties of quadratic maps. Discret. Comput. Geom. 13, 189–202 (1995)
Pataki, G.: On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23(2), 339–358 (1998)
Huang, Y., Palomar, D.P.: Rank-constrained separable semidefinite programming with applications to optimal beamforming. IEEE Trans. Signal Process. 58(2), 664–678 (2009)
Beck, A., Ben-Tal, A.: Duality in robust optimization: primal worst equals dual best. Oper. Res. Lett. 37, 1–6 (2009)
Jeyakumar, V., Li, G.Y.: Strong duality in robust convex programming: complete characterizations. SIAM J. Optim. 20, 3384–3407 (2010)
Jeyakumary, V., Liz, G., Lee, G.M.: Robust duality for generalized convex programming problems under data uncertainty. Nonlinear Anal.: Theory Methods Appl. 75(3), 1362–1373 (2012)
Jeyakumary, V., Li, G.Y.: Robust duality for fractional programming problems with constraint-wise data uncertainty. J. Optim. Theory Appl. 151(2), 292–303 (2011)
Meyer, C.D.: Matrix Analysis and Applied Linear Algebra. Society for Industrial and Applied Mathematics, SIAM (2001)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer, Berlin (2011)
Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by NSFC 11271243, Innovation Program of Shanghai Municipal Education Commission (12ZZ071), Shanghai Pujiang Program (11PJC059) and Muroran Institute of Technology (MuIT), Japan.
Rights and permissions
About this article
Cite this article
Wang, Y., Shi, R. & Shi, J. Duality and robust duality for special nonconvex homogeneous quadratic programming under certainty and uncertainty environment. J Glob Optim 62, 643–659 (2015). https://doi.org/10.1007/s10898-015-0281-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-015-0281-8