{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:52:58Z","timestamp":1760597578539},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T00:00:00Z","timestamp":1376611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11075-013-9757-0","type":"journal-article","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T15:21:48Z","timestamp":1376580108000},"page":"741-759","source":"Crossref","is-referenced-by-count":5,"title":["A model-hybrid approach for unconstrained optimization problems"],"prefix":"10.1007","volume":"66","author":[{"given":"Fu-Sheng","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jin-Bao","family":"Jian","sequence":"additional","affiliation":[]},{"given":"Chuan-Long","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,8,16]]},"reference":[{"issue":"2","key":"9757_CR1","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF00939608","volume":"76","author":"NY Deng","year":"1993","unstructured":"Deng, N.Y., Xiao, Y., Zhou, F.J.: Nonmonotonic trust region algorithm. J. Optim. Theory. Appl. 76(2), 259\u2013285 (1993)","journal-title":"J. Optim. Theory. Appl."},{"key":"9757_CR2","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"JT Mo","year":"2007","unstructured":"Mo, J.T., Liu, C.Y., Yan, S.C.: A nonmonotone trust region method based on nonincreasing technique of weighted average of the successive function values. J. Comput. Appl. Math. 209, 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"9757_CR3","doi-asserted-by":"crossref","first-page":"2158","DOI":"10.1016\/j.camwa.2007.08.038","volume":"55","author":"NZ Gu","year":"2008","unstructured":"Gu, N.Z., Mo, J.T.: Incorporating nonmonotone strategies into the trust region method for unconstrained optimization. Appl. Math. Comput. 55, 2158\u20132172 (2008)","journal-title":"Appl. Math. Comput."},{"key":"9757_CR4","doi-asserted-by":"crossref","unstructured":"Liu, J.H., Ma, C.F.: A nonmonotone trust region method with new inexact line search for unconstrained optimization. Numer. Algorithm. (2012). doi: 10.1007\/s11075-012-9652-0","DOI":"10.1007\/s11075-012-9652-0"},{"issue":"1","key":"9757_CR5","first-page":"68","volume":"31","author":"X Zhao","year":"2010","unstructured":"Zhao, X., Wang, X.Y.: A nonmonotone self-adaptive trust region algorithm with line search based on the new conic model. J. Taiyuan Univ. Sci. Tech. 31(1), 68\u201371 (2010)","journal-title":"J. Taiyuan Univ. Sci. Tech."},{"key":"9757_CR6","doi-asserted-by":"crossref","unstructured":"Nocedal, J., Yuan, Y.X.: Combining Trust-Region and Line-Search Techniques, Optimization Technology Center mar OTC 98\/04 (1998)","DOI":"10.1007\/978-1-4613-3335-7_7"},{"key":"9757_CR7","first-page":"447","volume":"100","author":"EM Gertz","year":"2004","unstructured":"Gertz, E.M.: A quasi-Newton trust-region method. Math. Program 100, 447\u2013470 (2004)","journal-title":"Math. Program"},{"key":"9757_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2007.06.034","volume":"190","author":"SJ Qu","year":"2008","unstructured":"Qu, S.J., Zhang, K.C., Wang, F.S.: A global optimization using linear relaxation for generalized geometric programming. Eur. J. Oper. Res. 190, 345\u2013356 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9757_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10479-008-0401-7","volume":"164","author":"FS Wang","year":"2008","unstructured":"Wang, F.S., Zhang, K.C.: A hybrid algorithm for nonlinear minimax problems. Ann. Oper. Res. 164, 167\u2013191 (2008)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9757_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0717023","volume":"17","author":"WC Davidon","year":"1980","unstructured":"Davidon, W.C.: Conic approximations and colinear scaling for optimizers. SIAM J. Numer. Anal. 17(2), 268\u2013281 (1980)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"9757_CR11","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0717011","volume":"17","author":"DC Sorensen","year":"1980","unstructured":"Sorensen, D.C.: The q-superlinear convergence of a colinear scaling algorithm for unconstrained optimization. SIAM J. Numer. Anal. 17(1), 84\u2013114 (1980)","journal-title":"SIAM J. Numer. Anal."},{"key":"9757_CR12","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01588777","volume":"49","author":"KA Ariyawansa","year":"1990","unstructured":"Ariyawansa, K.A.: Deriving collinear scaling algorithms as extension of quasi-Newton methods and the local convergence of DFP and BFGS related collinear scaling algorithms. Math. Program 49, 23\u201348 (1990)","journal-title":"Math. Program"},{"key":"9757_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02238081","volume":"54","author":"S Sheng","year":"1995","unstructured":"Sheng, S.: Interpolation by conic model for unconstrained optimization. Computing 54, 83\u201398 (1995)","journal-title":"Computing"},{"key":"9757_CR14","first-page":"43","volume":"13","author":"WY Sun","year":"1996","unstructured":"Sun, W.Y.: Nonquadratic model optimization methods. Asia Pac. J. Oper. Res. 13, 43\u201363 (1996)","journal-title":"Asia Pac. J. Oper. Res."},{"key":"9757_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1137\/0906019","volume":"6","author":"H Gourgeon","year":"1985","unstructured":"Gourgeon, H., Nocedal, J.: A conic algorithm for optimization. SIAM J. Sci. Comput. 6, 253\u2013267 (1985)","journal-title":"SIAM J. Sci. Comput."},{"key":"9757_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1080\/10556789608805637","volume":"6","author":"S Di","year":"1996","unstructured":"Di, S., Sun, W.Y.: A trust region method for conic model to solve unconstrained optimization. Optim. Methods Softw. 6, 237\u2013263 (1996)","journal-title":"Optim. Methods Softw."},{"key":"9757_CR17","first-page":"71","volume":"11","author":"CX Xu","year":"1998","unstructured":"Xu, C.X., Yang, X.Y.: Convergence of conic quasi-Newton trust region menthods for unconstrained minimization. Mathematica Applicata 11, 71\u201376 (1998)","journal-title":"Mathematica Applicata"},{"key":"9757_CR18","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF02935796","volume":"19","author":"JH Fu","year":"2005","unstructured":"Fu, J.H., Sun, W.Y., Sampaio, R.J.B.: An adaptive approach of conic trust-region method for unconstrained optimization problems. J. Appl. Math. Comput. 19, 165\u2013177 (2005)","journal-title":"J. Appl. Math. Comput."},{"key":"9757_CR19","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s11425-007-0149-6","volume":"51","author":"JY Wang","year":"2008","unstructured":"Wang, J.Y., Ni, Q.: An algorithm for solving new trust region subproblem with conic model. Sci. China Ser. A 51, 461\u2013473 (2008)","journal-title":"Sci. China Ser. A"},{"key":"9757_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00934743","volume":"43","author":"L Grandinetti","year":"1984","unstructured":"Grandinetti, L.: Some investigations in a new algorithm for nonlinear optimization based on conic models of the objective function. J. Optim. Theory Appl. 43, 1\u201321 (1984)","journal-title":"J. Optim. Theory Appl."},{"key":"9757_CR21","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/B978-0-12-597050-1.50006-3","volume-title":"Nonlinear Programming","author":"MJD Powell","year":"1970","unstructured":"Powell, M.J.D.: A new algorithm for unconstrained optimization. In: Rosen, J.B., Mangasarian, O.L., Ritter, K. (eds.) Nonlinear Programming, pp. 31\u201366. Academic, New York (1970)"},{"key":"9757_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s12190-012-0572-x","volume":"40","author":"QY Zhou","year":"2012","unstructured":"Zhou, Q.Y., Zhang, C.: A new nonmonotone adaptive trust region method based on simple quadratic models. J. Appl. Math. Comput. 40, 111\u2013123 (2012)","journal-title":"J. Appl. Math. Comput."},{"key":"9757_CR23","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. SIAM Publications, Philadelphia (2000)"},{"key":"9757_CR24","volume-title":"Numerical Optimization, 2nd edn","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York (2006)"},{"key":"9757_CR25","first-page":"1C27","volume-title":"Nonlinear Programming, vol. 2","author":"MJD Powell","year":"1975","unstructured":"Powell, M.J.D.: Convergence properties of a class of minimization algorithms. In: Mangasarian, O.L., Meyer, R.R., Robinson, S.M. (eds.) Nonlinear Programming, vol. 2, p. 1C27. Academic, New York (1975)"},{"key":"9757_CR26","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF00932218","volume":"28","author":"JE Dennis","year":"1979","unstructured":"Dennis, J.E., Mei, H.H.W.: Two new unconstrained optimization algorithms which use function and gradient values. J. Optim. Theory Appl. 28, 453\u2013482 (1979)","journal-title":"J. Optim. Theory Appl."},{"key":"9757_CR27","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/0722003","volume":"22","author":"GA Shultz","year":"1985","unstructured":"Shultz, G.A., Schnabel, R.B., Byrd, R.H.: A family of trust-region based algorithm for unconstrained minimization with strong global convergence. SIAM J. Numer. Anal. 22, 47\u201367 (1985)","journal-title":"SIAM J. Numer. Anal."},{"key":"9757_CR28","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01580735","volume":"40","author":"RH Byrd","year":"1988","unstructured":"Byrd, R.H., Schnabel, R.B., Shultz, G.A.: Approximation solution of the trust region problem by minimization over two-dimensional subspace. Math. Program 40, 247\u2013263 (1988)","journal-title":"Math. Program"},{"key":"9757_CR29","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug, T.: The conjugate gradient method and trust-regions in large scale optimization. SIAM J. Numer. Anal. 20, 626\u2013627 (1983)","journal-title":"SIAM J. Numer. Anal."},{"key":"9757_CR30","first-page":"57","volume-title":"Sparse Matrices and Their Uses","author":"PL Toint","year":"1981","unstructured":"Toint, P.L.: Towards an efficient sparsity exploiting Newton method for minimization. In: Duff, I.S. (ed.) Sparse Matrices and Their Uses, pp. 57\u201388. Academic, London (1981)"},{"key":"9757_CR31","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ More","year":"1983","unstructured":"More, J.J., Sorensen, D.C.: Computing a trust-region step. SIAM J. Sci. Stat. Comput. 4, 553\u2013572 (1983)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9757_CR32","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ More","year":"1981","unstructured":"More, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"9757_CR33","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program 91, 201\u2013213 (2002)","journal-title":"Math. Program"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9757-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-013-9757-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-013-9757-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,21]],"date-time":"2019-07-21T01:21:10Z","timestamp":1563672070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-013-9757-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8,16]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["9757"],"URL":"https:\/\/doi.org\/10.1007\/s11075-013-9757-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"value":"1017-1398","type":"print"},{"value":"1572-9265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,8,16]]}}}