Abstract
We study the problem of minimizing the ratio of quadratic functions with a quadratic constraint (QCRQ), which is a generation of the trust-region subproblem and covers the regularized total least square problem as a special case. In this paper, we carefully employ the bisection search method to solve the scaled Lagrangian dual of (QCRQ) as strong duality holds for the primal and dual problems. We show that our algorithm can globally solve the nonconvex optimization (QCRQ) in linear time. Numerical experiments demonstrate the computational efficiency over other semidefinite programming solvers.
Similar content being viewed by others
References
Beck A, Ben-Tal A (2012) On the solution of the Tikhonov regularization of the total least squares problem. SIAM J Optim 17(1):98–118
Beck A, Teboulle M (2009) A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. Math Progr 118(1):13–35
Beck A, Ben-Tal A, Teboulle M (2006) 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(2):425–445
Boyd S, Vandenberghe L (2003) Convex optimization. Cambridge University Press, Cambridge
Fallahi S, Salahi M, Terlaky T (2018) Minimizing an indefinite quadratic function subject to a single indefinite quadratic constraint. Optimization 68(1):55–65
Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. The Johns Hopkins University Press, Baltimore
Grant M, Boyd S (2015) CVX: MATLAB software for disciplined convex programming, version 2.1. http://cvxr.com/cvx
Hazan E, Koren T (2016) A linear-time algorithm for trust region problems. Math Progr 158(1):363–381
Ho-Nguyen N, Kılınç-Karzan F (2017) A second-order cone based approach for solving the trust-region subproblem and its variants. SIAM J Optim 27(3):1485–1512
Kuczyński J, Woźniakowski H (1992) Estimating the largest eigenvalue by the power and Lanczos algorithms with a random start. SIAM J Matrix Anal Appl 13(4):1094–1122
Lampe J, Voss H (2010) Solving regularized total least squares problems based on eigenproblems. Taiwan J Math 14(3A):885–909
Lehoucq RB, Sorenson DC, Yang C (1998) ARPACK users’s guide. SIAM, Philadelphia
Markovsky I, Van Huffel S (2007) Overview of total least-squares methods. Sig Process 87(10):2283–2302
Mesarovic VZ, Galatsanos NP, Katsaggelos AK (1995) Regularized constrained total least squares image restoration. IEEE Trans Image Process 4(8):1096–1108
Moré JJ (1993) Generalization of the trust region problem. Optim Methods Softw 2(3):189–209
Nguyen VB, Sheu RL, Xia Y (2016) An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. Optim Methods Softw 31(4):701–719
Pólik I, Terlaky T (2007) A survey of the S-lemma. SIAM Rev 49(3):371–418
Renaut RA, Guo H (2015) Efficient algorithms for solution of regularized total least squares. SIAM J Matrix Anal Appl 26(2):457–476
Sima DM, Van Huffel S, Golub GH (2004) Regularized total least squares based on quadratic eigenvalue problem solvers. BIT Numer Math 44(4):793–812
Sturm JF (1999) Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11(1–4):625–653
Taati A, Salahi M (2019) A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint. Comput Optim Appl 74(1):195–223
Toh KC, Todd MJ, Tütüncü RH (1999) SDPT3—a MATLAB software package for semidefinite programming, version 1.3. Optim Methods Softw 11(1–4):545–581
Tütüncü RH, Toh KC, Todd MJ (2003) Solving semidefinite-quadratic-linear programs using SDPT3. Math Progr 95(2):189–217
Wang J, Xia Y (2017) A linear-time algorithm for the trust region subproblem based on hidden convexity. Optim Lett 11(8):1639–1646
Xia Y (2015) On minimizing the ratio of quadratic functions over an ellipsoid. Optimization 64(5):1097–1106
Xia Y (2020) A survey of hidden convex optimization. J Oper Res Soc China 8(1):1–28
Yakubovich VA (1977) S-procedure in nonlinear control theory. Vestnik Leningrad Univ 4:73–93
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Paulo J. S. Silva.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
The work is partially supported by NSFC under Grants 11971231, 11771210, 11822103 and Beijing Natural Science Foundation Z180005.
Rights and permissions
About this article
Cite this article
Wang, L., Ma, T. & Xia, Y. A linear-time algorithm for minimizing the ratio of quadratic functions with a quadratic constraint. Comp. Appl. Math. 40, 150 (2021). https://doi.org/10.1007/s40314-021-01527-1
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-021-01527-1