An approach for minimizing a quadratically constrained fractional quadratic problem with application to the communications over wireless channels

References

• W.B. Ai, Y.W. Huang, and S.Z. Zhang, New results on Hermitian matrix rank-one decomposition, Math. Program. Ser. A. 128 (2011), pp. 253–283. doi: 10.1007/s10107-009-0304-7
   Web of Science ®Google Scholar
• A. Beck, A. Ben-Tal, and M. Teboulle, Finding a global optimal solution for a quadratically constrained fractional quadratic problem with applications to the regularized total least squares, SIAM J. Matrix Anal. Appl. 28 (2006), pp. 425–445. doi: 10.1137/040616851
   Web of Science ®Google Scholar
• M. Bellare and P. Rogaway, The complexity of approximating a nonlinear program, Math. Program. 69 (1995), pp. 429–442.
   Web of Science ®Google Scholar
• H.P. Benson, On the global optimization of sum of linear fractional functions over a convex set, J. Optim. Theory Appl. 121 (2004), pp. 19–39. doi: 10.1023/B:JOTA.0000026129.07165.5a
   Web of Science ®Google Scholar
• C.S. Colantoni, R.P. Manes, and A. Whinston, Programming, Parda-los rates, and pricing decisions, Account. Rev. 44 (1969), pp. 467–481.
   Web of Science ®Google Scholar
• B.D. Craven, Fractional Programming, Sigma Series in Applied Mathematics, Vol. 4, Heldermann Verlag, Berlin, 1988.
   Google Scholar
• W. Dinkelbach, On nonlinear fractional programming, Manage. Sci. 13 (1967), pp. 492–498. doi: 10.1287/mnsc.13.7.492
   Google Scholar
• J.E. Falk and S.W. Palocsay, Optimizing the sum of linear fractional functions, in Recent Advances in Global Optimization, C.A. Floudas and P.M. Parda-los, eds., Princeton University Press, Princeton, NJ, 1992, pp. 221–258.
   Google Scholar
• S.C. Feng, D.Y. Gao, R.L. Sheu, and W.X. Xing, Global optimization for a class of fractional programming problems, J. Global Optim. 45 (2009), pp. 337–353. doi: 10.1007/s10898-008-9378-7
   Web of Science ®Google Scholar
• R.W. Freund and F. Jarre, Solving the sum-of-ratios problem by an interior-point method, J. Global Optim. 19 (2001), pp. 83–102. doi: 10.1023/A:1008316327038
   Web of Science ®Google Scholar
• S.M. He, Z.N. Li, and S.Z. Zhang, Approximation algorithms for homogeneous polynomial optimization with quadratic constraints, Math. Program. Ser. A 125(2) (2010), pp. 353–383. doi: 10.1007/s10107-010-0409-z
   Web of Science ®Google Scholar
• S.M. He, Z.Q. Luo, J.W. Nie, and S.Z. Zhang, Semidefinite relaxation bounds for indefinite homogeneous quadratic optimization, SIAM J. Optim. 19 (2008), pp. 503–523. doi: 10.1137/070679041
   Web of Science ®Google Scholar
• M. Heinkensehlos, On the solution of a two balls trust region subproblem, Math. Program. 64 (1994), pp. 249–276. doi: 10.1007/BF01582576
   Web of Science ®Google Scholar
• L.T. Hoai, An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints, Math. Program. Ser. A 87 (2000), pp. 401–426. doi: 10.1007/s101070050003
   Web of Science ®Google Scholar
• Y.W. Huang and S.Z. Zhang, Approximation algorithms for indefinite complex quadratic maximization problems, Sci. China Ser. A 53(10) (2010), pp. 2697–2708. doi: 10.1007/s11425-010-3087-7
   Google Scholar
• P.K. Kanchan, A.S.B. Holland, and B.N. Sahney, Transportation techniques in linear-plus-fractional programming, Cahiers du CERO 23 (1981), pp. 153–157.
   Google Scholar
• T. Kuno, A branch-and-bound algorithm for maximizing the sum of several linear ratios, J. Global Optim. 22 (2002), pp. 155–174. doi: 10.1023/A:1013807129844
   Web of Science ®Google Scholar
• Z. Luo, N. Sidiropoulos, P. Tseng, and S. Zhang, Approximation bounds for quadratic optimization with homogeneous quadratic constraints, SIAM J. Optim., 18(1) (2007), pp. 1–28. doi: 10.1137/050642691
   Web of Science ®Google Scholar
• J.M. Martinez and S.A. Santos, A trust region strategy for minimization on arbitrary domains, Math. Program. 68 (1995), pp. 267–301. doi: 10.1007/BF01585768
   Web of Science ®Google Scholar
• A. Nemirovskii, C. Roos, and T. Terlaky, On maximization of quadratic form over intersection of ellipsoids with common centers, Math. Program. 86 (1999), pp. 463–473. doi: 10.1007/s101070050100
   Web of Science ®Google Scholar
• P.M. Pardalos and A. Phillips, Global optimization of fractional programs, J. Global Optim. 1 (1991), pp. 173–182. doi: 10.1007/BF00119990
   Google Scholar
• J.M. Peng and Y. Yuan, Optimality conditions for the minimization of a quadratic with two quadratic constraints, SIAM J. Optim. 7 (1997), pp. 579–594. doi: 10.1137/S1052623494261520
   Web of Science ®Google Scholar
• I.M. Stancu-Minasian, Applications of the fractional programming, Econ. Comput. Econ. Cybern. Stud. Res. 1 (1980), pp. 69–86.
   Google Scholar
• J.F. Sturm and S. Zhang, On cones of nonnegative quadratic functions, Math. Oper. Res. 28 (2003), pp. 246–267. doi: 10.1287/moor.28.2.246.14485
   Web of Science ®Google Scholar
• Y.Y. Ye, Linear conic programming, Work Paper, 2004; available at http://www.stanford.edu/class/msande314.
   Google Scholar
• T. Yi, L. Guo, K. Niu, H.Y. Cai, J.R. Lin, and W.B. Ai, Cooperative beamforming in cognitive radio network with hybrid relay, 19th International Conference on Telecommunications (ICT), 2012, doi: 10.1109/ICTEL.2012.6221214.
   Google Scholar
• G. Zheng, K.K. Wong, A. Paulraj, and B. Ottersten, Collaborative-relay beamforming with perfect CSI: Optimum and distributed implementation, IEEE Signal Process. Lett. 16(4) (2009), pp. 257–260. doi: 10.1109/LSP.2008.2010810
   Web of Science ®Google Scholar