{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T17:40:11Z","timestamp":1716313211531},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,12,17]],"date-time":"2013-12-17T00:00:00Z","timestamp":1387238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s11590-013-0711-9","type":"journal-article","created":{"date-parts":[[2013,12,16]],"date-time":"2013-12-16T11:17:53Z","timestamp":1387192673000},"page":"283-310","source":"Crossref","is-referenced-by-count":5,"title":["A new trust region method for solving least-square transformation of system of equalities and inequalities"],"prefix":"10.1007","volume":"9","author":[{"given":"D. Ataee","family":"Tarzanagh","sequence":"first","affiliation":[]},{"given":"Z.","family":"Saeidian","sequence":"additional","affiliation":[]},{"given":"M. Reza","family":"Peyghami","sequence":"additional","affiliation":[]},{"given":"H.","family":"Mesgarani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,17]]},"reference":[{"key":"711_CR1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.camwa.2010.04.034","volume":"60","author":"M Ahookhosh","year":"2010","unstructured":"Ahookhosh, M., Amini, K.: A nonmonotone trust region method with adaptive radius for unconstrained optimization. Comput. Math. Appl. 60, 411\u2013422 (2010)","journal-title":"Comput. Math. Appl."},{"key":"711_CR2","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s11075-011-9502-5","volume":"59","author":"M Ahookhosh","year":"2012","unstructured":"Ahookhosh, M., Amini, K.: An efficient nonmonotone trust-region method for unconstrained opti-mization. Numer. Algor. 59, 523\u2013540 (2012)","journal-title":"Numer. Algor."},{"key":"711_CR3","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.apm.2011.07.021","volume":"36","author":"M Ahookhosh","year":"2012","unstructured":"Ahookhosh, M., Amini, K., Peyghami, M.R.: A nonmonotone trust-region line search method for large-scale unconstrained optimization. Appl. Math. Model 36, 478\u2013487 (2012)","journal-title":"Appl. Math. Model"},{"key":"711_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0120945","volume":"16","author":"RM Chamberlain","year":"1982","unstructured":"Chamberlain, R.M., Powell, M.J.D., Lemarechal, C., Pedersen, H.C.: The watchdog technique for forcing convergence in algorithm for constrained optimization. Math. Program. Stud. 16, 1\u201317 (1982)","journal-title":"Math. Program. Stud."},{"key":"711_CR5","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1007\/s10589-012-9460-4","volume":"53","author":"Z Cui","year":"2012","unstructured":"Cui, Z., Wu, B.: A new modified nonmonotone adaptive trust region method for unconstrained optimization. Comput. Optim. Appl. 53, 795\u2013806 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"711_CR6","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/BF01436488","volume":"6","author":"JW Daniel","year":"1973","unstructured":"Daniel, J.W.: Newton\u2019s method for nonlinear inequalities. Numer. Math. 6, 381\u2013387 (1973)","journal-title":"Numer. Math."},{"issue":"2","key":"711_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/A:1013653923062","volume":"112","author":"YH Dai","year":"2002","unstructured":"Dai, Y.H.: On the nonmonotone line search. J. Optim.Theory Appl. 112(2), 315\u2013330 (2002)","journal-title":"J. Optim.Theory Appl."},{"key":"711_CR8","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, 259\u2013285 (1993)","journal-title":"J. Optim.Theory Appl."},{"key":"711_CR9","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/S1052623494276208","volume":"9","author":"JE Dennis","year":"1999","unstructured":"Dennis, J.E., El-Alem, M., Williamson, K.: A trust-region approach to nonlinear system of equalities and inequalities. SIAM J. Control Optim. 9, 291\u2013315 (1999)","journal-title":"SIAM J. Control Optim."},{"key":"711_CR10","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"711_CR11","unstructured":"Fan, J.Y., Yuan, Y.X.: A new trust region algorithm with trust region radius converging to zero. In: Proceedings of the 5th International Conference on Optimization: Techniques and Applications (2001)"},{"key":"711_CR12","doi-asserted-by":"crossref","unstructured":"Fletcher, R., Leyffer, S.: Filter-type algorithm for solving system of algebraic aquations and inequalities. In: Di Pillo, G., Murli, A. (eds.) High Performance Algorithms and Software for Nonlinear Optimization, pp. 259\u2013278. Kluwer, Dordrecht (2003)","DOI":"10.1007\/978-1-4613-0241-4_12"},{"key":"711_CR13","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization, Nonconvex Optimization and its Applications, p. 33. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3040-1_5"},{"key":"711_CR14","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.cam.2004.08.013","volume":"177","author":"JB Francisco","year":"2005","unstructured":"Francisco, J.B., Krejis, N., Martinez, J.M.: An interior-point method for solving box-constraned unconstrained nonlinear system. J. Comput. Appl. Math. 177, 67\u201388 (2005)","journal-title":"J. Comput. Appl. Math."},{"key":"711_CR15","unstructured":"Gould, N.I.M., Leyffer, S., Toint, Ph.L.: FILTRANE A Fortran 95 filter-trust-region package for solving nonlinear least-squers and nonlinear feasibility problems. ACM Trans. Math. Softw. 33, 3\u201325 (2007)"},{"key":"711_CR16","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: A nonmonotone line search technique for Newton\u2019s method. SIAM J. Numer. Anal. 23, 707\u2013716 (1986)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"711_CR17","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF00940345","volume":"60","author":"L Grippo","year":"1989","unstructured":"Grippo, L., Lamparillo, F., Lucidi, S.: A truncated Newton method with nonmonotone line search for unconstrained optimization. J. Optim. Theory Appl. 60(3), 401\u2013419 (1989)","journal-title":"J. Optim. Theory Appl."},{"key":"711_CR18","doi-asserted-by":"crossref","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematical Systems, p. 187. Springer, Berlin (1981)","DOI":"10.1007\/978-3-642-48320-2"},{"key":"711_CR19","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1016\/j.apnum.2008.03.028","volume":"59","author":"M Macconi","year":"2009","unstructured":"Macconi, M., Morini, B., Porcelli, M.: Trust-region quadratic methods for nonlinear system of mixed equalities and inqualities. Appl. Numer. Math. 59, 859\u2013876 (2009)","journal-title":"Appl. Numer. Math."},{"key":"711_CR20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.cam.2006.10.070","volume":"209","author":"J Mo","year":"2007","unstructured":"Mo, J., Liu, C., Yan, S.: A nonmonotone trust region method based on nonincreasing technique of weighted avrage of the successive function values. J. Comput. Appl. Math. 209, 97\u2013108 (2007)","journal-title":"J. Comput. Appl. Math."},{"key":"711_CR21","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hilstron, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"711_CR22","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10589-010-9327-5","volume":"51","author":"B Morini","year":"2012","unstructured":"Morini, B., Porcelli, M.: TRESNEI, a matlab trust-region solver for systems of nonlinear equalities and inequalities. Comput. Optim. Appl. 51(1), 27\u201349 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"711_CR23","first-page":"152","volume-title":"Advances in Nonlinear Programming","author":"J Nocedal","year":"1996","unstructured":"Nocedal, J., Yuan, Y.: Combining trust region and line search techniques. In: Yuan, Y. (ed.) Advances in Nonlinear Programming, pp. 152\u2013175. Kluwer, Dordrecht (1996)"},{"key":"711_CR24","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"key":"711_CR25","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1137\/0728063","volume":"28","author":"ER Panier","year":"1991","unstructured":"Panier, E.R.: Avoiding the Maratos effect by means of a nonmonotone linesearch. SIAM J. Numer. Anal. 28, 1183\u20131195 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"711_CR26","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s11590-011-0430-z","volume":"7","author":"M Porcelli","year":"2013","unstructured":"Porcelli, M.: On the convergence of an inexact Guass-Newton trust region method for nonlinear least squares problems with simple bounds. Optim. Lett. 7, 447\u2013465 (2013)","journal-title":"Optim. Lett."},{"key":"711_CR27","unstructured":"Sang, Z., Sun, Q.: A self-adaptive trust region method with line search based on a simple subproblem model. J. Comput. Appl. Math. 232, 514\u2013522 (2009)"},{"issue":"6","key":"711_CR28","doi-asserted-by":"crossref","first-page":"1788","DOI":"10.1137\/S1064827595286955","volume":"18","author":"A Sartenaer","year":"1997","unstructured":"Sartenaer, A.: Automatic determination of an initial trust region in nonlinear programming. SIAM J. Sci. Comput. 18(6), 1788\u20131803 (1997)","journal-title":"SIAM J. Sci. Comput."},{"key":"711_CR29","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/j.cam.2007.01.027","volume":"213","author":"ZJ Shi","year":"2008","unstructured":"Shi, Z.J., Guo, J.H.: A new trust region methods for unconstrained optimization. J. Comput. Appl. Math. 213, 509\u2013520 (2008)","journal-title":"J. Comput. Appl. Math."},{"key":"711_CR30","unstructured":"Toint, Ph.L.: An assessment of nonmonotone line search technique for unconstrained optimization. SIAM J. Sci. Comput. 17, 725\u2013739 (1996)"},{"key":"711_CR31","doi-asserted-by":"crossref","unstructured":"Toint, Ph.L.: Nonmonotone trust-region algorithm for nonlinear optimization subject to convex constraints. Math. Program 77, 69\u201394 (1997)","DOI":"10.1007\/BF02614518"},{"issue":"4","key":"711_CR32","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1137\/S1052623403428208","volume":"14","author":"H Zhang","year":"2004","unstructured":"Zhang, H.: A nonmonotone line search technique and its application to unconstrained optimization. SIAM J. Optim. 14(4), 1043\u20131056 (2004)","journal-title":"SIAM J. Optim."},{"key":"711_CR33","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1360\/02ys9067","volume":"45","author":"XS Zhang","year":"2002","unstructured":"Zhang, X.S., Zhang, J.L., Liao, L.Z.: An adaptive trust region method and its convergence. Sci. China. 45, 620\u2013631 (2002)","journal-title":"Sci. China."},{"key":"711_CR34","doi-asserted-by":"crossref","first-page":"1469","DOI":"10.1016\/S0898-1221(03)00130-5","volume":"45","author":"XS Zhang","year":"2003","unstructured":"Zhang, X.S., Zhang, J.L., Liao, L.Z.: A nonmonotone adaptive trust region method and its convergence. Int. Comput. Math. Appl. 45, 1469\u20131477 (2003)","journal-title":"Int. Comput. Math. Appl."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0711-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-013-0711-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-013-0711-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T17:07:40Z","timestamp":1716311260000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-013-0711-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,17]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["711"],"URL":"https:\/\/doi.org\/10.1007\/s11590-013-0711-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,17]]}}}