{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T17:37:31Z","timestamp":1648921051877},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2014,3,28]],"date-time":"2014-03-28T00:00:00Z","timestamp":1395964800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10898-014-0170-6","type":"journal-article","created":{"date-parts":[[2014,3,27]],"date-time":"2014-03-27T07:35:24Z","timestamp":1395905724000},"page":"209-225","source":"Crossref","is-referenced-by-count":3,"title":["Globally convergent DC trust-region methods"],"prefix":"10.1007","volume":"59","author":[{"given":"Hoai An","family":"Le Thi","sequence":"first","affiliation":[]},{"given":"Van Ngai","family":"Huynh","sequence":"additional","affiliation":[]},{"given":"Tao Pham","family":"Dinh","sequence":"additional","affiliation":[]},{"given":"A. Ismael F.","family":"Vaz","sequence":"additional","affiliation":[]},{"given":"L. N.","family":"Vicente","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,28]]},"reference":[{"key":"170_CR1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertesekas","year":"1982","unstructured":"Bertesekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20, 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"key":"170_CR2","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1196\u20131211 (2000)","journal-title":"SIAM J. Optim."},{"key":"170_CR3","doi-asserted-by":"crossref","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J., Zhu, C.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16, 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"170_CR4","doi-asserted-by":"crossref","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Wiley, New York, NY (1983) Reissued by SIAM Philadelphia (1990)","DOI":"10.1137\/1.9781611971309"},{"key":"170_CR5","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"TF Coleman","year":"1996","unstructured":"Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6, 418\u2013445 (1996)","journal-title":"SIAM J. Optim."},{"key":"170_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1137\/0725029","volume":"25","author":"AR Conn","year":"1988","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 25, 433\u2013460 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"170_CR7","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1137\/0726044","volume":"26","author":"AR Conn","year":"1989","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Correction to the paper on global convergence of a class of trust region algorithms for optimization with simple bounds. SIAM J. Numer. Anal. 26, 764\u2013767 (1989)","journal-title":"SIAM J. Numer. Anal."},{"key":"170_CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods. MPS-SIAM Series on Optimization","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: Trust-Region Methods. MPS-SIAM Series on Optimization. SIAM, Philadelphia (2000)"},{"key":"170_CR9","doi-asserted-by":"crossref","first-page":"986","DOI":"10.1137\/040613305","volume":"16","author":"Y-H Dai","year":"2006","unstructured":"Dai, Y.-H.: Fast algorithms for projection on an ellipsoid. SIAM J. Optim. 16, 986\u20131006 (2006)","journal-title":"SIAM J. Optim."},{"key":"170_CR10","unstructured":"Dennis, J.E., Vicente, L.N.: Trust-region interior-point algorithms for minimization problems with simple bounds. In: Fisher, H., Riedm\u00fcller, B., Sch\u00e4ffer, S. (eds.) Applied Mathematics and Parallel Computing, pp. 97\u2013107. Physica-Verlag, Springer-Verlag, Berlin (1996). Festschrift for Klaus Ritter"},{"key":"170_CR11","unstructured":"Dennis J.E. Jr, Schnabel, R.B.: Methods, Numerical, for Unconstrained Optimization and Nonlinear Equations. Prentice-Hall, Englewood Cliffs (republished by SIAM, Philadelphia, in 1996, as Classics in Applied Mathematics, 16) (1983)."},{"key":"170_CR12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"170_CR13","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/S1052623493253991","volume":"8","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., J\u00fadice, J., Soares, J.: An active set Newton\u2019s algorithm for large-scale nonlinear programs with box constraints. SIAM J. Optim. 8, 158\u2013186 (1998)","journal-title":"SIAM J. Optim."},{"key":"170_CR14","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01183013","volume":"30","author":"A Friedlander","year":"1994","unstructured":"Friedlander, A., Mart\u00ednez, J.M., Santos, S.A.: A new trust region algorithm for bound constrained minimization. Appl. Math. Optim. 30, 235\u2013266 (1994)","journal-title":"Appl. Math. Optim."},{"key":"170_CR15","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: Contrained and Unconstrainted Test Environement, Revisited. http:\/\/cuter.rl.ac.uk\/cuter-www"},{"key":"170_CR16","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: Results from a Numerical Evaluation of LANCELOT B. Internal Report 2002-1, Numerical Analysis Group, Rutherford Appleton Laboratory, Chilton, England (2002)"},{"key":"170_CR17","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/962437.962438","volume":"29","author":"NIM Gould","year":"2004","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization. ACM Trans. Math. Softw. 29, 353\u2013372 (2004)","journal-title":"ACM Trans. Math. Softw."},{"key":"170_CR18","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1137\/050635225","volume":"17","author":"WW Hager","year":"2006","unstructured":"Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17, 526\u2013557 (2006)","journal-title":"SIAM J. Optim."},{"key":"170_CR19","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s101070050107","volume":"86","author":"M Heinkenschloss","year":"1999","unstructured":"Heinkenschloss, M., Ulbrich, M., Ulbrich, S.: Superlinear and quadratic convergence of affine-scaling interior-point Newton methods for problems with simple bounds without strict complementarity assumption. Math. Program. 86, 615\u2013635 (1999)","journal-title":"Math. Program."},{"key":"170_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"HA Thi Le","year":"2003","unstructured":"Le Thi, H.A., Pham Dinh, T.: Large scale molecular optimization from distance matrices by a D.C. optimization approach. SIAM J. Optim. 14, 77\u2013114 (2003)","journal-title":"SIAM J. Optim."},{"key":"170_CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"HA Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"170_CR22","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/0728026","volume":"28","author":"M Lescrenier","year":"1991","unstructured":"Lescrenier, M.: Convergence of trust region algorithms for optimization with bounds when strict complementarity does not hold. SIAM J. Numer. Anal. 28, 476\u2013495 (1991)","journal-title":"SIAM J. Numer. Anal."},{"key":"170_CR23","unstructured":"Lin, C.-J., Mor\u00e9, J.J.: TRON, A Trust Region Newton Method for the Solution of Large Bound-Constrained Optimization Problems. http:\/\/www.mcs.anl.gov\/~more\/tron\/"},{"key":"170_CR24","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"C-J Lin","year":"1999","unstructured":"Lin, C.-J., Mor\u00e9, J.J.: Newton\u2019s method for large bound-constrained optimization problems. SIAM J. Optim. 9, 1100\u20131127 (1999)","journal-title":"SIAM J. Optim."},{"key":"170_CR25","doi-asserted-by":"crossref","unstructured":"Morales, J.L., Nocedal, J.: Remark on algorithm 778. L-BFGS-B, Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw. 38, 7:1\u20137:4 (2011)","DOI":"10.1145\/2049662.2049669"},{"key":"170_CR26","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"170_CR27","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to D.C. programming: theory, algorithms and applications. Acta Math. Vietnam 22, 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"key":"170_CR28","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: A D.C. optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"170_CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"170_CR30","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, Berlin (1997), third printing in 2009 (1997)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"170_CR31","doi-asserted-by":"crossref","first-page":"835","DOI":"10.1080\/10556780701322970","volume":"22","author":"C Sainvitu","year":"2007","unstructured":"Sainvitu, C., Toint, P.L.: A filter-trust-region method for simple-bound constrained optimization. Optim. Methods Softw. 22, 835\u2013848 (2007)","journal-title":"Optim. Methods Softw."},{"key":"170_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1022690711754","volume":"92","author":"A Schwartz","year":"1997","unstructured":"Schwartz, A., Polak, E.: Family of projected descent methods for optimization problems with simple bounds. J. Optim. Theory Appl. 92, 1\u201331 (1997)","journal-title":"J. Optim. Theory Appl."},{"key":"170_CR33","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10898-007-9133-5","volume":"39","author":"AIF Vaz","year":"2007","unstructured":"Vaz, A.I.F., Vicente, L.N.: A particle swarm pattern search method for bound constrained global optimization. J. Glob. Optim. 39, 197\u2013219 (2007)","journal-title":"J. Glob. Optim."},{"key":"170_CR34","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"170_CR35","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778. L-BFGS-B, Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw. 23, 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0170-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0170-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0170-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T19:59:06Z","timestamp":1565294346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0170-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,28]]},"references-count":35,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0170-6","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,28]]}}}