{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:27:58Z","timestamp":1740144478983,"version":"3.37.3"},"reference-count":45,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T00:00:00Z","timestamp":1708560000000},"content-version":"vor","delay-in-days":52,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004607","name":"Natural Science Foundation of Guangxi Province","doi-asserted-by":"publisher","award":["2020GXNSFAA159014"],"award-info":[{"award-number":["2020GXNSFAA159014"]}],"id":[{"id":"10.13039\/501100004607","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2023,10,3]]},"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:p>In this paper, a three-dimensional subspace conjugate gradient method is proposed, in which the search direction is generated by minimizing the approximation model of the objective function in a three-dimensional subspace. The approximation model is not unique and is alternative between quadratic model and conic model by the specific criterions. The strategy of initial stepsize and nonmonotone line search are adopted, and the global convergence of the presented algorithm is established under mild assumptions. In numerical experiments, we use a collection of 80 unconstrained optimization test problems to show the competitive performance of the presented method.<\/jats:p>","DOI":"10.1051\/ro\/2023161","type":"journal-article","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T08:00:41Z","timestamp":1696406441000},"page":"775-802","source":"Crossref","is-referenced-by-count":0,"title":["An alternative three-dimensional subspace method based on conic model for unconstrained optimization"],"prefix":"10.1051","volume":"58","author":[{"given":"Guoxin","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mingyang","family":"Pei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zengxin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengwei","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2024,2,22]]},"reference":[{"key":"R1","first-page":"147","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim."},{"key":"R2","first-page":"319","volume":"34","author":"Andrei","year":"2011","journal-title":"Bull. Malays. Math. Sci. Soc."},{"key":"R3","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s11075-013-9718-7","volume":"65","author":"Andrei","year":"2014","journal-title":"Numer. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Andrei N., Nonlinear conjugate gradient methods for unconstrained optimization, Springer Optimization and Its Applications 158. Springer, Cham (2020).","key":"R4","DOI":"10.1007\/978-3-030-42950-8"},{"key":"R5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01588777","volume":"49","author":"Ariyawansa","year":"1990","journal-title":"Math. Program."},{"key":"R6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10589-021-00338-8","volume":"81","author":"Bai","year":"2022","journal-title":"Comput. Optim. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"Barzilai","year":"1988","journal-title":"IMA J. Numer. Anal."},{"unstructured":"Beale E.M.L., A derivation of conjugate gradients. In: Numerical Methods for Nonlinear Optimization. Academic Press, London (1972) 39\u201343.","key":"R8"},{"key":"R9","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1137\/0709024","volume":"9","author":"Cohen","year":"1972","journal-title":"SIAM J. Numer. Anal."},{"key":"R10","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1147\/rd.164.0431","volume":"16","author":"Crowder","year":"1972","journal-title":"IBM J. Res. Dev."},{"key":"R11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","volume":"10","author":"Dai","year":"1999","journal-title":"SIAM J. Optim."},{"key":"R12","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","volume":"23","author":"Dai","year":"2013","journal-title":"SIAM J. Optim."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1511","DOI":"10.1007\/s11425-016-0279-2","volume":"59","author":"Dai","year":"2016","journal-title":"Sci. China Math."},{"key":"R14","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1023\/B:NUMA.0000021761.10993.6e","volume":"35","author":"Dai","year":"2004","journal-title":"Numer. Algorithms"},{"key":"R15","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/A:1014838419611","volume":"22","author":"Dai","year":"2002","journal-title":"Comput. Optim. Appl."},{"key":"R16","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0717023","volume":"17","author":"Davidon","year":"1980","journal-title":"SIAM J. Numer. Anal."},{"key":"R17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/10556789608805637","volume":"6","author":"Di","year":"1996","journal-title":"Optim. Methods Softw."},{"key":"R18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"unstructured":"Fletcher R., Practical methods of optimization. Vol. 1: Unconstrained optimization. Wiley-Interscience, New York (1980).","key":"R19"},{"key":"R20","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"R21","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1145\/1132973.1132979","volume":"32","author":"Hager","year":"2006","journal-title":"ACM Trans. Math. Softw."},{"key":"R22","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"R23","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s11075-017-0434-6","volume":"79","author":"Li","year":"2018","journal-title":"Numer. Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Li Y., Liu Z. and Liu H., A subspace minimization conjugate gradient method based on conic model for unconstrained optimization. Comput. Appl. Math. 38 (2019).","key":"R24","DOI":"10.1007\/s40314-019-0779-7"},{"key":"R25","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/BF00940464","volume":"69","author":"Liu","year":"1991","journal-title":"J. Optim. Theory Appl."},{"key":"R26","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11075-017-0365-2","volume":"78","author":"Liu","year":"2018","journal-title":"Numer. Algorithms"},{"key":"R27","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1007\/s10957-018-1393-3","volume":"180","author":"Liu","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"R28","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF00933041","volume":"13","author":"McCormick","year":"1975","journal-title":"J. Optim. Theory Appl."},{"unstructured":"Nocedal J. and Wright S.J., Numerical Optimization. Springer, New York (2006).","key":"R29"},{"key":"R30","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Comput. Math. Math. Phys."},{"key":"R31","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01593790","volume":"12","author":"Powell","year":"1977","journal-title":"Math. Program."},{"key":"R32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02238081","volume":"54","author":"Sheng","year":"1995","journal-title":"Computing"},{"key":"R33","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0717011","volume":"17","author":"Sorensen","year":"1980","journal-title":"SIAM J. Numer. Anal."},{"key":"R34","first-page":"43","volume":"13","author":"Sun","year":"1996","journal-title":"Asia. Pac. J. Oper. Res."},{"unstructured":"Sun W. and Yuan Y., Optimization Theory and Methods: Nonlinear Programming. Springer, New York (2006).","key":"R35"},{"doi-asserted-by":"crossref","unstructured":"Sun W., Li Y., Wang T. and Liu H., A new subspace minimization conjugate gradient method based on conic model for large-scale unconstrained optimization. Comput. Appl. Math. 41 (2022).","key":"R36","DOI":"10.1007\/s40314-022-01885-4"},{"key":"R37","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1137\/1011036","volume":"11","author":"Wolfe","year":"1969","journal-title":"SIAM Rev."},{"key":"R38","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1137\/1013035","volume":"13","author":"Wolfe","year":"1971","journal-title":"SIAM Rev."},{"key":"R39","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1007\/s11075-017-0284-2","volume":"76","author":"Yang","year":"2017","journal-title":"Numer. Algorithms"},{"key":"R40","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/imanum\/11.3.325","volume":"11","author":"Yuan","year":"1991","journal-title":"IMA J. Numer. Anal."},{"key":"R41","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1080\/10556789308805532","volume":"2","author":"Yuan","year":"1993","journal-title":"Optim. Methods Softw."},{"doi-asserted-by":"crossref","unstructured":"Yuan Y.X., Subspace techniques for nonlinear optimization. In: Some Topics in Industrial and Applied Mathematics. Higher Education Press, Beijing (2007) 206\u2013218.","key":"R42","DOI":"10.1142\/9789812709356_0012"},{"unstructured":"Yuan Y.X., A review on subspace methods for nonlinear optimization. In: Proc. of the International Congress of Mathematics. Seoul, Korea, 13-21 August (2014) 807\u2013827.","key":"R43"},{"key":"R44","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/zamm.19950750118","volume":"75","author":"Yuan","year":"1995","journal-title":"Z. Angew. Math. Mech."},{"key":"R45","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"Zhang","year":"2004","journal-title":"SIAM J. Optim."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023161\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,22]],"date-time":"2024-02-22T09:14:13Z","timestamp":1708593253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2023161"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1]]},"references-count":45,"journal-issue":{"issue":"1"},"alternative-id":["ro220660"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2023161","relation":{},"ISSN":["0399-0559","2804-7303"],"issn-type":[{"type":"print","value":"0399-0559"},{"type":"electronic","value":"2804-7303"}],"subject":[],"published":{"date-parts":[[2024,1]]}}}