{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:25:48Z","timestamp":1740122748973,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T00:00:00Z","timestamp":1571184000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T00:00:00Z","timestamp":1571184000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"PRONEX-CNPq\/FAPERJ","award":["E-26\/111.449\/2010-APQ1"],"award-info":[{"award-number":["E-26\/111.449\/2010-APQ1"]}]},{"name":"CEPID\u2013Industrial Mathematics\/FAPESP","award":["2011\/51305-02"],"award-info":[{"award-number":["2011\/51305-02"]}]},{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2013\/05475-7","2013\/07375-0"],"award-info":[{"award-number":["2013\/05475-7","2013\/07375-0"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Portuguese Foundation for Science and Technology","award":["UID\/MAT\/00297\/2019"],"award-info":[{"award-number":["UID\/MAT\/00297\/2019"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10589-019-00138-1","type":"journal-article","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T18:34:58Z","timestamp":1571250898000},"page":"169-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization"],"prefix":"10.1007","volume":"75","author":[{"given":"C. P.","family":"Br\u00e1s","sequence":"first","affiliation":[]},{"given":"J. M.","family":"Mart\u00ednez","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0417-7981","authenticated-orcid":false,"given":"M.","family":"Raydan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,16]]},"reference":[{"key":"138_CR1","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10589-017-9929-2","volume":"68","author":"E Bergou","year":"2017","unstructured":"Bergou, E., Diouane, Y., Gratton, S.: On the use of the energy norm in trust-region and adaptive cubic regularization subproblems. Comput. Optim. Appl. 68, 533\u2013554 (2017)","journal-title":"Comput. Optim. Appl."},{"key":"138_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s10957-018-1341-2","volume":"178","author":"E Bergou","year":"2018","unstructured":"Bergou, E., Diouane, Y., Gratton, S.: A line-search algorithm inspired by the adaptive cubic regularization framework and Complexity Analysis. J. Optim. Theory Appl. 178, 885\u2013913 (2018)","journal-title":"J. Optim. Theory Appl."},{"key":"138_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.ejor.2003.06.018","volume":"160","author":"EG Birgin","year":"2005","unstructured":"Birgin, E.G., Mart\u00ednez, J.M., Ronconi, D.P.: Optimizing the packing of cylinders into a rectangular container: a nonlinear approach. Eur. J. Oper. Res. 160, 19\u201333 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"138_CR4","doi-asserted-by":"publisher","first-page":"1892","DOI":"10.1137\/060652749","volume":"46","author":"PN Brown","year":"2008","unstructured":"Brown, P.N., Walker, H.F., Wasyk, R., Woodward, C.S.: On using approximate finite-differences in matrix-free Newton\u2013Krylov methods. SIAM J. Numer. Anal. 46, 1892\u20131911 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"138_CR5","doi-asserted-by":"publisher","first-page":"1190","DOI":"10.1137\/0916069","volume":"16","author":"RH Byrd","year":"1995","unstructured":"Byrd, R.H., Lu, P., Nocedal, J.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Stat. Comput. 16, 1190\u20131208 (1995)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"138_CR6","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1137\/090774100","volume":"20","author":"C Cartis","year":"2010","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: On the complexity of steepest descent, Newton\u2019s and regularized Newton\u2019s methods for nonconvex unconstrained optimization. SIAM J. Optim. 20, 2833\u20132852 (2010)","journal-title":"SIAM J. Optim."},{"key":"138_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-009-0286-5","volume":"127","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularization methods for unconstrained optimization. Part I: motivation motivation, convergence and numerical results. Math. Program. 127, 245\u2013295 (2011)","journal-title":"Math. Program."},{"key":"138_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s10107-009-0337-y","volume":"130","author":"C Cartis","year":"2011","unstructured":"Cartis, C., Gould, N.I.M., Toint, P.L.: Adaptive cubic regularization methods for unconstrained optimization. Part II: worst-case function and derivative complexity. Math. Program. 130, 295\u2013319 (2011)","journal-title":"Math. Program."},{"key":"138_CR9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719857","volume-title":"Trust Region Methods","author":"AR Conn","year":"2000","unstructured":"Conn, A.R., Gould, N.I.M., Toint, PhL: Trust Region Methods. Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"138_CR10","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1590\/S0101-74382000000200009","volume":"20","author":"MH Correia","year":"2000","unstructured":"Correia, M.H., Oliveira, J.F., Ferreira, J.S.: Cylinder packing by simulated annealing. Pesqui. Oper. 20, 269\u2013284 (2000)","journal-title":"Pesqui. Oper."},{"key":"138_CR11","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1111\/1475-3995.00334","volume":"8","author":"MH Correia","year":"2001","unstructured":"Correia, M.H., Oliveira, J.F., Ferreira, J.S.: A new upper bound for the cylinder packing problem. Int. Trans. Oper. Res. 8, 571\u2013583 (2001)","journal-title":"Int. Trans. Oper. Res."},{"key":"138_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-016-1026-2","volume":"162","author":"FE Curtis","year":"2017","unstructured":"Curtis, F.E., Robinson, D.P., Samadi, M.: A trust-region algorithm with a worst-case iteration complexity of $$O(\\varepsilon ^{-3\/2})$$. Math. Program. 162, 1\u201332 (2017)","journal-title":"Math. Program."},{"key":"138_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971446","volume-title":"Applied Numerical Linear Algebra","author":"JW Demmel","year":"1997","unstructured":"Demmel, J.W.: Applied Numerical Linear Algebra. SIAM, Philadelphia (1997)"},{"key":"138_CR14","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s11590-009-0132-y","volume":"3","author":"G Fasano","year":"2009","unstructured":"Fasano, G., Lucidi, S.: A nonmonotone truncated Newton\u2013Krylov method exploiting negative curvature directions, for large scale unconstrained optimization. Optim. Lett. 3, 521\u2013535 (2009)","journal-title":"Optim. Lett."},{"key":"138_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10589-013-9563-6","volume":"56","author":"G Fasano","year":"2013","unstructured":"Fasano, G., Roma, M.: Preconditioning Newton\u2013Krylov methods in nonconvex large scale optimization. Comput. Optim. Appl. 56, 253\u2013290 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"138_CR16","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1137\/S1052623497322735","volume":"9","author":"NIM Gould","year":"1999","unstructured":"Gould, N.I.M., Lucidi, S., Roma, M., Toint, P.L.: Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9, 504\u2013525 (1999)","journal-title":"SIAM J. Optim."},{"key":"138_CR17","unstructured":"Grapiglia, G.N., Nesterov, Y.: Globally convergent second-order schemes for minimizing twice differentiable functions. CORE Discussion Paper 2016\/28. Universit\u00e9 Catholique de Louvain, Louvain, Belgium (2017)"},{"key":"138_CR18","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia, G.N., Yuan, J.-Y., Yuan, Y.-X.: On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math. Program. 152, 491\u2013520 (2015)","journal-title":"Math. Program."},{"key":"138_CR19","unstructured":"Griewank, A.: The modification of Newton\u2019s method for unconstrained optimization by bounding cubic terms. Technical Report NA\/12, Department of Applied Mathematics and Theoretical Physics, University of Cambridge (1981)"},{"key":"138_CR20","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718188","volume-title":"The Lanczos Method: Evolution and Application","author":"L Komzsik","year":"2003","unstructured":"Komzsik, L.: The Lanczos Method: Evolution and Application. SIAM, Philadelphia (2003)"},{"key":"138_CR21","doi-asserted-by":"publisher","first-page":"255","DOI":"10.6028\/jres.045.026","volume":"45","author":"C Lanczos","year":"1950","unstructured":"Lanczos, C.: An iteration method for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Stand. 45, 255\u2013282 (1950)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"138_CR22","unstructured":"LAPACK-Linear Algebra PACKage. \nhttp:\/\/www.netlib.org\/lapack\n\n (2013)"},{"key":"138_CR23","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10589-010-9363-1","volume":"51","author":"S Lu","year":"2012","unstructured":"Lu, S., Wei, Z., Li, L.: A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput. Optim. Appl. 51, 551\u2013573 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"138_CR24","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10898-015-0278-3","volume":"63","author":"JM Mart\u00ednez","year":"2015","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization. J. Glob. Optim. 63(2), 319\u2013342 (2015)","journal-title":"J. Glob. Optim."},{"key":"138_CR25","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10898-016-0475-8","volume":"68","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez, J.M., Raydan, M.: Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J. Glob. Optim. 68, 367\u2013385 (2017)","journal-title":"J. Glob. Optim."},{"key":"138_CR26","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"JJ Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, 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":"138_CR27","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1137\/0721052","volume":"21","author":"SG Nash","year":"1984","unstructured":"Nash, S.G.: Newton-type minimization via the Lanczos method. SIAM J. Numer. Anal. 21, 770\u2013788 (1984)","journal-title":"SIAM J. Numer. Anal."},{"key":"138_CR28","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-006-0706-8","volume":"108","author":"Y Nesterov","year":"2006","unstructured":"Nesterov, Y., Polyak, B.T.: Cubic reglarization of Newton\u2019s method and its global performance. Math. Program. 108, 177\u2013205 (2006)","journal-title":"Math. Program."},{"key":"138_CR29","unstructured":"Packomania. Test instances. \nhttp:\/\/www.packomania.com\/\n\n. Accessed 3 Mar 2018"},{"key":"138_CR30","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1137\/S105262349928887X","volume":"11","author":"M Rojas","year":"2000","unstructured":"Rojas, M., Santos, S.A., Sorensen, D.C.: A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optim. 11, 611\u2013646 (2000)","journal-title":"SIAM J. Optim."},{"key":"138_CR31","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739","volume-title":"Numerical Methods for Large Eigenvalue Problems","author":"Y Saad","year":"2011","unstructured":"Saad, Y.: Numerical Methods for Large Eigenvalue Problems, 2nd edn. SIAM, Philadelphia (2011)","edition":"2"},{"key":"138_CR32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718058","volume-title":"Matrix Algorithms: Eigensystems","author":"GW Stewart","year":"2001","unstructured":"Stewart, G.W.: Matrix Algorithms: Eigensystems, vol. II. SIAM, Philadelphia (2001)"},{"issue":"2","key":"138_CR33","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"138_CR34","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s00211-006-0021-6","volume":"104","author":"Z-H Wang","year":"2006","unstructured":"Wang, Z.-H., Yuan, Y.-X.: A subspace implementation of quasi-Newton trust region methods for unconstrained optimization. Numer. Math. 104, 241\u2013269 (2006)","journal-title":"Numer. Math."},{"key":"138_CR35","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s101070050012","volume":"87","author":"Y Yuan","year":"2000","unstructured":"Yuan, Y.: On the truncated conjugate gradient method. Math. Program. 87, 561\u2013571 (2000)","journal-title":"Math. Program."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00138-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00138-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00138-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:27:53Z","timestamp":1602718073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00138-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,16]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["138"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00138-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,10,16]]},"assertion":[{"value":"16 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}