{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:58:51Z","timestamp":1760597931236,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T00:00:00Z","timestamp":1581120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T00:00:00Z","timestamp":1581120000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10589-020-00175-1","type":"journal-article","created":{"date-parts":[[2020,2,8]],"date-time":"2020-02-08T21:02:41Z","timestamp":1581195761000},"page":"201-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient local search procedures for quadratic fractional programming problems"],"prefix":"10.1007","volume":"76","author":[{"given":"Luca","family":"Consolini","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7138-8653","authenticated-orcid":false,"given":"Marco","family":"Locatelli","sequence":"additional","affiliation":[]},{"given":"Jiulin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,8]]},"reference":[{"issue":"1","key":"175_CR1","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/050624418","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck, A., Ben-Tal, A.: On the solution of the Tikhonov regularization of the total least squares problem. SIAM J. Optim. 17(1), 98\u2013118 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"175_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/040616851","volume":"28","author":"A Beck","year":"2006","unstructured":"Beck, A., Ben-Tal, A., Teboulle, M.: 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\u2013445 (2006)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"175_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10107-007-0181-x","volume":"118","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid. Math. Program. 118, 13\u201335 (2009)","journal-title":"Math. Program."},{"key":"175_CR4","first-page":"789","volume":"17","author":"A Beck","year":"2010","unstructured":"Beck, A., Teboulle, M.: On minimizing quadratically constrained ratio of two quadratic functions. J. Convex Anal. 17, 789\u2013804 (2010)","journal-title":"J. Convex Anal."},{"key":"175_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1006\/jmaa.2001.7650","volume":"263","author":"HP Benson","year":"2001","unstructured":"Benson, H.P.: Global optimization of nonlinear sums of ratios. J. Math. Anal. Appl. 263, 301\u2013315 (2001)","journal-title":"J. Math. Anal. Appl."},{"key":"175_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1013072027218","volume":"112","author":"HP Benson","year":"2002","unstructured":"Benson, H.P.: Global optimization algorithm for the nonlinear sum of ratios problem. J. Optim. Theory Appl. 112, 1\u201329 (2002)","journal-title":"J. Optim. Theory Appl."},{"key":"175_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1013869015288","volume":"22","author":"HP Benson","year":"2002","unstructured":"Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problems. J. Glob. Optim. 22, 343\u2013364 (2002)","journal-title":"J. Glob. Optim."},{"key":"175_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-007-9199-8","volume":"135","author":"HP Benson","year":"2007","unstructured":"Benson, H.P.: Solving sum of ratios fractional programs via concave minimization. J. Optim. Theory Appl. 135, 1\u201317 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"175_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-013-0710-8","volume":"143","author":"A Ben-Tal","year":"2014","unstructured":"Ben-Tal, A., den Hertog, D.: Hidden conic quadratic representation of some nonconvex quadratic optimization problems. Math. Program. 143, 1\u201329 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"175_CR10","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/15M1009871","volume":"26","author":"D Bienstock","year":"2016","unstructured":"Bienstock, D.: A note on polynomial solvability of the CDT problem. SIAM J. Optim. 26(1), 488\u2013498 (2016)","journal-title":"SIAM J. Optim."},{"key":"175_CR11","first-page":"71","volume-title":"Numerical Optimization","author":"MR Celis","year":"1985","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Boggs, P.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimization, pp. 71\u201382. SIAM, Philadelphia (1985)"},{"issue":"1\u20132","key":"175_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-016-1073-8","volume":"164","author":"L Consolini","year":"2017","unstructured":"Consolini, L., Locatelli, M.: On the complexity of quadratic programming with two quadratic constraints. Math. Program. 164(1\u20132), 91\u2013128 (2017)","journal-title":"Math. Program."},{"key":"175_CR13","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-009-0309-2","volume":"128","author":"D Depetrini","year":"2011","unstructured":"Depetrini, D., Locatelli, M.: Approximation of linear fractional\/multiplicative problems. Math. Program. 128, 437\u2013443 (2011)","journal-title":"Math. Program."},{"key":"175_CR14","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","volume":"13","author":"W Dinkelbach","year":"1967","unstructured":"Dinkelbach, W.: On nonlinear fractional programming. Manag. Sci. 13, 492\u2013498 (1967)","journal-title":"Manag. Sci."},{"issue":"4","key":"175_CR15","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1137\/S1064827594263837","volume":"18","author":"RD Fierro","year":"1997","unstructured":"Fierro, R.D., Golub, G.H., Hansen, P.C., O\u2019Leary, D.P.: Regularization by truncated total least squares. SIAM J. Sci. Comput. 18(4), 1223\u20131241 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"175_CR16","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1008316327038","volume":"19","author":"RW Freund","year":"2001","unstructured":"Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Glob. Optim. 19, 83\u2013102 (2001)","journal-title":"J. Glob. Optim."},{"key":"175_CR17","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/S0895479897326432","volume":"21","author":"GH Golub","year":"1999","unstructured":"Golub, G.H., Hansen, P.C., O\u2019Leary, D.P.: Tikhonov regularization and total least squares. SIAM J. Numer. Anal. 21, 185\u2013194 (1999)","journal-title":"SIAM J. Numer. Anal."},{"issue":"6","key":"175_CR18","doi-asserted-by":"publisher","first-page":"1487","DOI":"10.1137\/0914086","volume":"14","author":"PC Hansen","year":"1993","unstructured":"Hansen, P.C., O\u2019Leary, D.P.: The use of the L-curve in the regularization of discrete ill-posed problems. SIAM J. Sci. Comput. 14(6), 1487\u20131503 (1993)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"175_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02149761","volume":"6","author":"PC Hansen","year":"1994","unstructured":"Hansen, P.C.: Regularization tools: a Matlab package for analysis and solution of discrete ill-posed problems. Numer. Algorithms 6(1), 1\u201335 (1994)","journal-title":"Numer. Algorithms"},{"key":"175_CR20","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1015222829062","volume":"29","author":"PC Hansen","year":"2002","unstructured":"Hansen, P.C.: Deconvolution and regularization with Toeplitz matrices. Numer. Algorithms 29, 323\u2013378 (2002)","journal-title":"Numer. Algorithms"},{"key":"175_CR21","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1008314922240","volume":"18","author":"H Konno","year":"2000","unstructured":"Konno, H., Fukaishi, K.: A branch and bound algorithm for solving low rank linear multiplicative and fractional programming problems. J. Glob. Optim. 18, 283\u2013299 (2000)","journal-title":"J. Glob. Optim."},{"key":"175_CR22","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1023\/A:1013807129844","volume":"22","author":"T Kuno","year":"2002","unstructured":"Kuno, T.: A branch-and-bound algorithm for maximizing the sum of several linear ratios. J. Glob. Optim. 22, 155\u2013174 (2002)","journal-title":"J. Glob. Optim."},{"key":"175_CR23","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.cam.2012.08.023","volume":"238","author":"J Lampe","year":"2013","unstructured":"Lampe, J., Voss, H.: Large-scale Tikhonov regularization of total least squares. J. Comput. Appl. Math. 238, 95\u2013108 (2013)","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"175_CR24","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1080\/10556788.2014.885521","volume":"30","author":"M Locatelli","year":"2015","unstructured":"Locatelli, M.: Alternative branching rules for some nonconvex problems. Optim. Methods Softw. 30(2), 365\u2013378 (2015)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"175_CR25","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1137\/070709086","volume":"31","author":"S Lu","year":"2009","unstructured":"Lu, S., Pereverzev, S.V., Tautenhahn, U.: Regularized total least squares: computational aspects and error bounds. SIAM J. Matrix Anal. Appl. 31(3), 918\u2013941 (2009)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"175_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF00121658","volume":"9","author":"T Matsui","year":"2006","unstructured":"Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Glob. Optim. 9, 113\u2013119 (2006)","journal-title":"J. Glob. Optim."},{"key":"175_CR27","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10107-011-0511-x","volume":"141","author":"S Mittal","year":"2013","unstructured":"Mittal, S., Schulz, A.S.: An FPTAS for optimizing a class of low-rank functions over a polytope. Math. Program. 141, 103\u2013120 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"175_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1080\/10556788.2015.1029575","volume":"31","author":"V-B Nguyen","year":"2016","unstructured":"Nguyen, V.-B., Sheu, R.-L., Xia, Y.: An SDP approach for quadratic fractional problems with a two-sided quadratic constraint. Optim. Methods Softw. 31(4), 701\u2013719 (2016)","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"175_CR29","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1137\/15100624X","volume":"26","author":"S Sakaue","year":"2016","unstructured":"Sakaue, S., Nakatsukasa, Y., Takeda, A., Iwata, S.: Solving generalized CDT problems via two-parameter eigenvalues. SIAM J. Optim. 26(3), 1669\u20131694 (2016)","journal-title":"SIAM J. Optim."},{"key":"175_CR30","volume-title":"Handbook of Global Optimization","author":"S Schaible","year":"1995","unstructured":"Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P. (eds.) Handbook of Global Optimization, vol. 1. Kluwer Academic Publishers, Berlin (1995)"},{"key":"175_CR31","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/1055678031000105242","volume":"18","author":"S Schaible","year":"2003","unstructured":"Schaible, S., Shi, J.: Fractional programming: the sum-of-ratios case. Optim. Methods Softw. 18, 219\u2013229 (2003)","journal-title":"Optim. Methods Softw."},{"key":"175_CR32","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1007\/s10543-004-6024-8","volume":"44","author":"DM Sima","year":"2004","unstructured":"Sima, D.M., Van Huffel, S., Golub, G.H.: Regularied total least squares based on quadratic eigenvalue problem solvers. BIT Numer. Math. 44, 793\u2013812 (2004)","journal-title":"BIT Numer. Math."},{"key":"175_CR33","doi-asserted-by":"publisher","first-page":"561","DOI":"10.2140\/pjm.1973.49.561","volume":"49","author":"F Uhlig","year":"1973","unstructured":"Uhlig, F.: Definite and semidefinite matrices in a real symmetric matrix pencil. Pac. J. Math. 49, 561\u2013568 (1973)","journal-title":"Pac. J. Math."},{"issue":"2","key":"175_CR34","first-page":"319","volume":"158","author":"Y-J Wang","year":"2004","unstructured":"Wang, Y.-J., Zhang, K.-C.: Global optimization of nonlinear sum of ratios problem. Appl. Math. Comput. 158(2), 319\u2013330 (2004)","journal-title":"Appl. Math. Comput."},{"key":"175_CR35","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s10589-018-0004-4","volume":"70","author":"M Yang","year":"2018","unstructured":"Yang, M., Xia, Y., Wang, J., Peng, J.: Efficiently solving total least squares with Tikhonov identical regularization. Comput. Optim. Appl. 70, 571\u2013592 (2018)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00175-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-020-00175-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-020-00175-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T02:53:34Z","timestamp":1612839214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-020-00175-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,8]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10589-020-00175-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2020,2,8]]},"assertion":[{"value":"18 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}