Abstract
This paper studies a class of nonconvex fractional minimization problem in which the feasible region is the intersection of the unit ball with a single linear inequality constraint. First, using Dinkelbach’s idea, it is shown that finding the global optimal solution of the underlying problem is equivalent to find the unique root of a function. Then using a diagonalization technique, we present an efficient method to solve the indefinite quadratic minimization problem with the original problem’s constraints within a generalized Newton-based iterative algorithm. Our preliminary numerical experiments on several randomly generated test problems show that the new approach is much faster in finding the global optimal solution than the known semidefinite relaxation approach, especially when solving large-scale problems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Beck A, Eldar YC (2006) Strong duality in nonconvex quadratic optimization with two quadratic constraints. SIAM J Optim 17:844–860
Beck A, Teboulle M (2009) A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. Math Program 118:13–35
Beck A, Teboulle M (2010) On minimizing quadratically constrained ratio of two quadratic functions. J Convex Anal 17:789–804
Burer S, Anstreicher KM (2013) Second-order cone constraints for extended trust region problems, Preprint. SIAM J Optim 23:432–451
S. Burer, B. Yang (2013) The trust region subproblem with non-intersecting linear constraints, working paper.
Fallahi S, Salahi M (2013) On the indefinite quadratic fractional optimization with two quadratic constraints. J Optim Theory Appl. doi:10.1007/s10957-013-0417-2
Dinkelbach W (1967) On nonlinear fractional programming. Manage Sci 13:492–498
Jeyakumary V, Liz GY (2014) Trust region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization, to appear in Math Prog.
Lo AW, MacKinlay AC (1997) Maximizing predictability in the stock and bond markets. Macroecon Dyn 1:102–134
Ohlson JA, Ziemba WT (1976) Optimal portfolio policies for an investor with a power utility function facing a log normal securities market. J Financ Quant Anal 11:57–71
Salahi M (2009) A short note on \({\min }_{x\in R^{n}} \frac{\left.\Vert Ax-b\right\Vert^{2} }{1+\left.\Vert x \Vert ^{2} \right.}\). Appl Math Comput 212:270–272
Salahi M (2011) A semidefinite relaxation scheme for quadratically constrained quadratic problems with an additional linear constraint. Iran J Oper Res 2:29–34
Sima D, Van Huffel S, Golub GH (2004) Regularized total least squares based on quadratic eigenvalue prblem solvers. BIT Num Math 44:793–812
Stancu-Minasian IM (1997) Fractional programming: theory., Methods and applicationsKluwer, Dordrecht
Zhang A, Hayashi Sh (2011) Celis-Dennis-Tapia based approach to quadratic fractional programming problems with two quadratic constraints. Numer Algebra Control Optimiz 1:83–98
Acknowledgments
The authors would like to thank reviewers for their comments and suggestions and Iran National Science Foundation (INSF) for supporting this research under project number 91001892.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Natasa Krejic.
Rights and permissions
About this article
Cite this article
Salahi, M., Fallahi, S. Parametric approach for solving quadratic fractional optimization with a linear and a quadratic constraint. Comp. Appl. Math. 35, 439–446 (2016). https://doi.org/10.1007/s40314-014-0199-7
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40314-014-0199-7
Keywords
- Fractional optimization
- Extended trust region subproblems
- Global optimization
- Generalized Newton method
- Semidefinite optimization relaxation