{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T19:50:00Z","timestamp":1778701800555,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T00:00:00Z","timestamp":1741132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["12461053"],"award-info":[{"award-number":["12461053"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Graduate Innovation Project of North Minzu University","award":["YCX24252"],"award-info":[{"award-number":["YCX24252"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2025,8]]},"DOI":"10.1007\/s12190-025-02427-x","type":"journal-article","created":{"date-parts":[[2025,3,4]],"date-time":"2025-03-04T22:04:34Z","timestamp":1741125874000},"page":"5103-5131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimizing the minimax affine fractional problem in reduced space"],"prefix":"10.1007","volume":"71","author":[{"given":"Binbin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-2097","authenticated-orcid":false,"given":"Yuelin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,5]]},"reference":[{"key":"2427_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/s10898-011-9813-z","volume":"55","author":"M Locatelli","year":"2013","unstructured":"Locatelli, M.: Approximation algorithm for a class of global optimization problems. J. Glob. Optim. 55, 13\u201325 (2013)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2427_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1049\/iet-cta.2012.0171","volume":"7","author":"F Ding","year":"2013","unstructured":"Ding, F.: Coupled-least-squares identification for multivariable systems. IET Control Theory A 7(1), 68\u201379 (2013)","journal-title":"IET Control Theory A"},{"issue":"15","key":"2427_CR3","doi-asserted-by":"publisher","first-page":"2019","DOI":"10.1080\/00207160.2012.698008","volume":"89","author":"F Ding","year":"2012","unstructured":"Ding, F., Gu, Y.: Performance analysis of the auxiliary model-based least-squares identification algorithm for one-step state-delay systems. Int. J. Comput. Math. 89(15), 2019\u20132028 (2012)","journal-title":"Int. J. Comput. Math."},{"issue":"9","key":"2427_CR4","doi-asserted-by":"publisher","first-page":"1840","DOI":"10.1080\/00207160.2013.772143","volume":"90","author":"Y Liu","year":"2013","unstructured":"Liu, Y., Ding, R.: Consistency of the extended gradient identification algorithm for multi-input multi-output systems with moving average noises. Int. J. Comput. Math. 90(9), 1840\u20131852 (2013)","journal-title":"Int. J. Comput. Math."},{"key":"2427_CR5","first-page":"493","volume":"5","author":"S Schaible","year":"2004","unstructured":"Schaible, S., Shi, J.: Recent developments in fractional programming: single ratio and maxmin case. J. Nonlinear Convex Anal. 5, 493\u2013506 (2004)","journal-title":"J. Nonlinear Convex Anal."},{"key":"2427_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9174-4","volume-title":"Linear-Fractional Programming: Theory, Methods, Applications and Software","author":"EB Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-Fractional Programming: Theory, Methods, Applications and Software. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"1\u20134","key":"2427_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/02331939908844423","volume":"45","author":"C Bajona-Xandri","year":"1999","unstructured":"Bajona-Xandri, C., Martinez-Legaz, J.E.: Lower subdifferentiability in minimax fractional programming. Optimization 45(1\u20134), 1\u201312 (1999)","journal-title":"Optimization"},{"key":"2427_CR8","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-1-4615-2025-2_10","volume-title":"Handbook of Global Optimization","author":"S Schaible","year":"1995","unstructured":"Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, vol. 168, pp. 495\u2013608. Kluwer, Dordrecht (1995)"},{"issue":"3","key":"2427_CR9","first-page":"295","volume":"39","author":"H Konno","year":"1996","unstructured":"Konno, H., Watanabe, H.: Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn. 39(3), 295\u2013306 (1996)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"2427_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming: Theory, Methods and Applications","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming: Theory, Methods and Applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"2427_CR11","volume-title":"Mathematical Programming with Type-I Functions","author":"AM Stancu","year":"2013","unstructured":"Stancu, A.M.: Mathematical Programming with Type-I Functions. Matrix Rom, Bucharest (2013)"},{"key":"2427_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/0-387-23393-8_8","volume-title":"Handbook of Generalized Convexity and Generalized Monotonicity. Nonconvex Optimization and Its Applications","author":"JB Frenk","year":"2005","unstructured":"Frenk, J.B., Schaible, S.: Fractional programming. In: Hadjisavvas, N., Komlosi, S., Schaible, S. (eds.) Handbook of Generalized Convexity and Generalized Monotonicity. Nonconvex Optimization and Its Applications, vol. 76, pp. 335\u2013386. Springer, New York (2005)"},{"issue":"3","key":"2427_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"NTH Phuong","year":"2003","unstructured":"Phuong, N.T.H., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26(3), 229\u2013259 (2003)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2427_CR14","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1023\/A:1021759318653","volume":"99","author":"M Gugat","year":"1998","unstructured":"Gugat, M.: Prox-regularization methods for generalized fractional programming. J. Optim. Theory Appl. 99(3), 691\u2013722 (1998)","journal-title":"J. Optim. Theory Appl."},{"key":"2427_CR15","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10898-011-9751-9","volume":"54","author":"CF Wen","year":"2012","unstructured":"Wen, C.F., Wu, H.C.: Using the parametric approach to solve the continuous-time linear fractional max\u2013min problems. J. Glob. Optim. 54, 129\u2013153 (2012)","journal-title":"J. Glob. Optim."},{"issue":"17","key":"2427_CR16","doi-asserted-by":"publisher","first-page":"2281","DOI":"10.1080\/00207160.2012.711906","volume":"89","author":"H Liu","year":"2012","unstructured":"Liu, H., Li, X., Huang, Y.: Trust-region method for box-constrained semismooth equations and its applications to complementary problems. Int. J. Comput. Math. 89(17), 2281\u20132306 (2012)","journal-title":"Int. J. Comput. Math."},{"key":"2427_CR17","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF01582229","volume":"67","author":"RW Freund","year":"1994","unstructured":"Freund, R.W., Jarre, F.: An interior-point method for fractional programs with convex constraints. Math. Program 67, 407\u2013440 (1994)","journal-title":"Math. Program"},{"issue":"1","key":"2427_CR18","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/s10957-018-1342-1","volume":"179","author":"S Addoune","year":"2018","unstructured":"Addoune, S., Boufi, K., Roubi, A.: Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs. J. Optim. Theory Appl. 179(1), 212\u2013239 (2018)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2427_CR19","doi-asserted-by":"publisher","first-page":"1578","DOI":"10.1137\/18M1199708","volume":"29","author":"K Boufi","year":"2019","unstructured":"Boufi, K., Roubi, A.: Duality results and dual bundle methods based on the dual method of centers for centers for minimax fractional programs. SIAM. J. Optim. 29(2), 1578\u20131602 (2019)","journal-title":"SIAM. J. Optim."},{"issue":"1","key":"2427_CR20","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0377-2217(87)90133-0","volume":"31","author":"J Borde","year":"1987","unstructured":"Borde, J., Crouzeix, J.P.: Convergence of a Dinkelbach-type algorithm in generalized fractional programming. Z. Oper. Res. 31(1), 31\u201354 (1987)","journal-title":"Z. Oper. Res."},{"issue":"2","key":"2427_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10957-005-4717-z","volume":"126","author":"JY Lin","year":"2005","unstructured":"Lin, J.Y., Sheu, R.L.: Modified Dinkelbach-type algorithm for generalized fractional programs with infinitely many ratios. J. Optim. Theory Appl. 126(2), 323\u2013343 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2427_CR22","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10957-008-9499-7","volume":"141","author":"HJ Chen","year":"2009","unstructured":"Chen, H.J., Schaible, S., Sheu, R.L.: Generic algorithm for generalized fractional programming. J. Optim. Theory Appl. 141(1), 93\u2013105 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"2427_CR23","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02192043","volume":"87","author":"AI Barros","year":"1995","unstructured":"Barros, A.I., Frenk, J.B.G.: Generalized fractional programming and cutting plane algorithms. J. Optim. Theory Appl. 87(1), 103\u2013120 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"5","key":"2427_CR24","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1080\/02331934.2017.1338698","volume":"66","author":"S Addoune","year":"2017","unstructured":"Addoune, S., El Haffari, M., Roubi, A.: A proximal point algorithm for generalized fractional programs. Optimization 66(5), 1495\u20131517 (2017)","journal-title":"Optimization"},{"key":"2427_CR25","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10957-020-01738-2","volume":"187","author":"K Boufi","year":"2020","unstructured":"Boufi, K., El-Haffari, M., Roubi, A.: Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions. J. Optim. Theory Appl. 187, 105\u2013132 (2020)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2427_CR26","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s11075-023-01591-0","volume":"95","author":"B Zhang","year":"2024","unstructured":"Zhang, B., Gao, Y., Liu, X., Huang, X.: Interval division and linearization algorithm for minimax linear fractional program. Numer. Algorithms 95(2), 839\u2013858 (2024)","journal-title":"Numer. Algorithms"},{"key":"2427_CR27","doi-asserted-by":"publisher","first-page":"806","DOI":"10.4028\/www.scientific.net\/KEM.460-461.806","volume":"460","author":"Q Feng","year":"2011","unstructured":"Feng, Q., Mao, H., Jiao, H.: A feasible method for a class of mathematical problems in manufacturing system. Key Eng. Mater. 460, 806\u2013809 (2011)","journal-title":"Key Eng. Mater."},{"issue":"8","key":"2427_CR28","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1080\/00207160.2013.860449","volume":"91","author":"H Jiao","year":"2014","unstructured":"Jiao, H., Liu, S.: A new linearization technique for minimax linear fractional programming. Int. J. Comput. Math. 91(8), 1730\u20131743 (2014)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"2427_CR29","first-page":"113","volume":"38","author":"CF Wang","year":"2018","unstructured":"Wang, C.F., Jiang, Y., Shen, P.P.: A new branch-and-bound algorithm for solving mini-max linear fractional programming. J. Math. 38(1), 113\u2013123 (2018)","journal-title":"J. Math."},{"issue":"1","key":"2427_CR30","first-page":"3584494","volume":"2021","author":"P Jia","year":"2021","unstructured":"Jia, P., Jiao, H., Shi, D., Yin, J.: An efficient branch-and-bound algorithm for globally solving minimax linear fractional programming problem. Math. Probl. Eng. 2021(1), 3584494 (2021)","journal-title":"Math. Probl. Eng."},{"key":"2427_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112682","volume":"164","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Li, B.: Solving min-max linear fractional programs based on image space branch-and-bound scheme. Chaos Solitons Fractals 164, 112682 (2022)","journal-title":"Chaos Solitons Fractals"},{"issue":"05","key":"2427_CR32","doi-asserted-by":"publisher","first-page":"2350036","DOI":"10.1142\/S0217595923500367","volume":"41","author":"H Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Shang, Y.: A novel affine relaxation-based algorithm for minimax affine fractional program. Asia-Pac. J. Oper. Res. 41(05), 2350036 (2024)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1","key":"2427_CR33","first-page":"195","volume":"18","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Ma, J., Shang, Y.: Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem. Pac. J. Optim. 18(1), 195\u2013212 (2022)","journal-title":"Pac. J. Optim."},{"issue":"1","key":"2427_CR34","volume":"2014","author":"H Jiao","year":"2014","unstructured":"Jiao, H., Wang, F., Chen, Y.: An effective branch and bound algorithm for minimax linear fractional programming. J. Appl. Math. 2014(1), 160262 (2014)","journal-title":"J. Appl. Math."},{"issue":"3","key":"2427_CR35","doi-asserted-by":"publisher","first-page":"1523","DOI":"10.1051\/ro\/2023075","volume":"57","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Ge, L., Shen, P., Shang, Y.: Efficient algorithm for globally computing the min-max linear fractional programming problem. Rairo-Oper. Res. 57(3), 1523\u20131537 (2023)","journal-title":"Rairo-Oper. Res."},{"issue":"2","key":"2427_CR36","doi-asserted-by":"publisher","first-page":"1787","DOI":"10.1007\/s12190-024-02027-1","volume":"70","author":"H Jiao","year":"2024","unstructured":"Jiao, H., Sun, Y., Wang, W., Shang, Y.: Global algorithm for effectively solving min\u2013max affine fractional programs. J. Appl. Math. Comput. 70(2), 1787\u20131811 (2024)","journal-title":"J. Appl. Math. Comput."},{"key":"2427_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2024.115900","volume":"448","author":"P Shen","year":"2024","unstructured":"Shen, P., Deng, Y., Wang, Y.: A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming. J. Comput. Appl. Math. 448, 115900 (2024)","journal-title":"J. Comput. Appl. Math."},{"issue":"4","key":"2427_CR38","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1080\/02331930600819613","volume":"55","author":"IM Stancu-Minasian","year":"2006","unstructured":"Stancu-Minasian, I.M.: A sixth bibliography of fractional programming. Optimization 55(4), 405\u2013428 (2006)","journal-title":"Optimization"},{"issue":"2","key":"2427_CR39","first-page":"309","volume":"15","author":"IM Stancu-Minasian","year":"2013","unstructured":"Stancu-Minasian, I.M.: A seventh bibliography of fractional programming. Adv. Model. Optim. 15(2), 309\u2013386 (2013)","journal-title":"Adv. Model. Optim."},{"issue":"3","key":"2427_CR40","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1080\/02331934.2016.1276179","volume":"66","author":"IM Stancu-Minasian","year":"2017","unstructured":"Stancu-Minasian, I.M.: A eighth bibliography of fractional programming. Optimization 66(3), 439\u2013470 (2017)","journal-title":"Optimization"},{"issue":"11","key":"2427_CR41","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1080\/02331934.2019.1632250","volume":"68","author":"IM Stancu-Minasian","year":"2019","unstructured":"Stancu-Minasian, I.M.: A ninth bibliography of fractional programming. Optimization 68(11), 2125\u20132169 (2019)","journal-title":"Optimization"},{"key":"2427_CR42","unstructured":"Stancu-Minasian, I.M., Upadhyay, B.B., Stancu, A.M.: A tenth bibliography of fractional programming. http:\/\/csm.ro\/web\/stancum\/FP10.pdf (2024)"},{"key":"2427_CR43","volume-title":"Programarea frac\u0163ionar\u0103 cu mai multe func\u0163ii-obiectiv","author":"IM Stancu-Minasian","year":"2011","unstructured":"Stancu-Minasian, I.M., Teodorescu, N.: Programarea frac\u0163ionar\u0103 cu mai multe func\u0163ii-obiectiv. Matrix Rom, Bucharest (2011)"},{"issue":"3","key":"2427_CR44","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/nav.3800150308","volume":"15","author":"A Charnes","year":"1968","unstructured":"Charnes, A., Cooper, W.: Programming with linear fractional functionals. Nav. Res. Log. 15(3), 449\u2013451 (1968)","journal-title":"Nav. Res. Log."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-025-02427-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-025-02427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T09:42:56Z","timestamp":1757151776000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-025-02427-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,5]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["2427"],"URL":"https:\/\/doi.org\/10.1007\/s12190-025-02427-x","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"value":"1598-5865","type":"print"},{"value":"1865-2085","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,5]]},"assertion":[{"value":"6 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}