{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:56Z","timestamp":1740141896388,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T00:00:00Z","timestamp":1680912000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T00:00:00Z","timestamp":1680912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"FCT - Fundac\u00e3o para a Ci\u00eancia e a Tecnologia","award":["PTDC\/MAT-APL\/28400\/2017","PTDC\/MAT-APL\/28400\/2017"],"award-info":[{"award-number":["PTDC\/MAT-APL\/28400\/2017","PTDC\/MAT-APL\/28400\/2017"]}]},{"name":"FCT - Fundac\u00e3o para a Ci\u00eancia e a Tecnologia","award":["CEECIND\/02211\/2017","UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["CEECIND\/02211\/2017","UIDP\/MAT\/00297\/2020"]}]},{"name":"FCT - Fundac\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDP\/MAT\/00297\/2020","UIDP\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDP\/MAT\/00297\/2020","UIDP\/MAT\/00297\/2020"]}]},{"name":"FCT - Fundac\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/MAT\/00297\/2020","UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020","UIDB\/MAT\/00297\/2020"]}]},{"name":"FCT - Fundac\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/MAT\/00297\/2020"],"award-info":[{"award-number":["UIDB\/MAT\/00297\/2020"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a derivative-free separable quadratic modeling and cubic regularization technique for solving smooth unconstrained minimization problems. The derivative-free approach is mainly concerned with building a quadratic model that could be generated by numerical interpolation or using a minimum Frobenius norm approach, when the number of points available does not allow to build a complete quadratic model. This model plays a key role to generate an approximated gradient vector and Hessian matrix of the objective function at every iteration. We add a specialized cubic regularization strategy to minimize the quadratic model at each iteration, that makes use of separability. We discuss convergence results, including worst case complexity, of the proposed schemes to first-order stationary points. Some preliminary numerical results are presented to illustrate the robustness of the specialized separable cubic algorithm.<\/jats:p>","DOI":"10.1007\/s10288-023-00541-9","type":"journal-article","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T12:02:46Z","timestamp":1680955366000},"page":"121-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization"],"prefix":"10.1007","volume":"22","author":[{"given":"A. L.","family":"Cust\u00f3dio","sequence":"first","affiliation":[]},{"given":"R.","family":"Garmanjani","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":[[2023,4,8]]},"reference":[{"key":"541_CR1","doi-asserted-by":"publisher","first-page":"764","DOI":"10.1093\/imanum\/drz076","volume":"41","author":"S Bellavia","year":"2021","unstructured":"Bellavia S, Gurioli G, Morini B (2021) Adaptive cubic regularization methods with dynamic inexact Hessian information and applications to finite-sum minimization. IMA J Numer Anal 41:764\u2013799","journal-title":"IMA J Numer Anal"},{"key":"541_CR2","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-016-1065-8","volume":"163","author":"EG Birgin","year":"2017","unstructured":"Birgin EG, Gardenghi JL, Mart\u00ednez JM, Santos SA, Toint PhL (2017) Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models. Math Program 163:359\u2013368","journal-title":"Math Program"},{"key":"541_CR3","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s10107-012-0578-z","volume":"134","author":"AS Bandeira","year":"2012","unstructured":"Bandeira AS, Scheinberg K, Vicente LN (2012) Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization. Math Program 134:223\u2013257","journal-title":"Math Program"},{"key":"541_CR4","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10589-019-00138-1","volume":"75","author":"CP Br\u00e1s","year":"2020","unstructured":"Br\u00e1s CP, Mart\u00ednez JM, Raydan M (2020) Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization. Comput Optim Appl 75:169\u2013205","journal-title":"Comput Optim Appl"},{"key":"541_CR5","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 NIM, Toint Ph.L (2011a) Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results. Math Program 127:245\u2013295","journal-title":"Math Program"},{"key":"541_CR6","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 NIM, Toint PhL (2011b) Adaptive cubic regularisation methods for unconstrained optimization. Part II: worst-case function- and derivative-evaluation complexity. Math Program 130:295\u2013319","journal-title":"Math Program"},{"key":"541_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1137\/100812276","volume":"22","author":"C Cartis","year":"2012","unstructured":"Cartis C, Gould NIM, Toint PhL (2012) On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization. SIAM J Optim 22:66\u201386","journal-title":"SIAM J Optim"},{"key":"541_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis C, Scheinberg K (2018) Global convergence rate analysis of unconstrained optimization methods based on probabilistic models. Math Program 169:337\u2013375","journal-title":"Math Program"},{"key":"541_CR9","doi-asserted-by":"publisher","first-page":"1269","DOI":"10.1007\/s11590-018-1316-0","volume":"13","author":"A Cristofari","year":"2019","unstructured":"Cristofari A, Dehghan Niri T, Lucidi S (2019) On global minimizers of quadratic functions with cubic regularization. Optim Lett 13:1269\u20131283","journal-title":"Optim Lett"},{"key":"541_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","volume":"111","author":"AR Conn","year":"2008","unstructured":"Conn AR, Scheinberg K, Vicente LN (2008a) Geometry of interpolation sets in derivative free optimization. Math Program 111:141\u2013172","journal-title":"Math Program"},{"key":"541_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn AR, Scheinberg K, Vicente LN (2008b) Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J Numer Anal 28:721\u2013748","journal-title":"IMA J Numer Anal"},{"key":"541_CR12","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1137\/060673424","volume":"20","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009a) Global convergence of general derivative-free trust-region algorithms to first- and second-order critical points. SIAM J Optim 20:387\u2013415","journal-title":"SIAM J Optim"},{"key":"541_CR13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to derivative-free optimization","author":"AR Conn","year":"2009","unstructured":"Conn AR, Scheinberg K, Vicente LN (2009b) Introduction to derivative-free optimization. SIAM, Philadelphia"},{"key":"541_CR14","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10589-009-9283-0","volume":"46","author":"AL Cust\u00f3dio","year":"2010","unstructured":"Cust\u00f3dio AL, Rocha H, Vicente LN (2010) Incorporating minimum Frobenius norm models in direct search. Comput Optim Appl 46:265\u2013278","journal-title":"Comput Optim Appl"},{"key":"541_CR15","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh M, Vicente LN, Zhang Z (2016) On the optimal order of worst case complexity of direct search. Optim Lett 10:699\u2013708","journal-title":"Optim Lett"},{"key":"541_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91:201\u2013213","journal-title":"Math Program"},{"key":"541_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1080\/10556780802409296","volume":"24","author":"G Fasano","year":"2009","unstructured":"Fasano G, Morales JL, Nocedal J (2009) On the geometry phase in model-based algorithms for derivative-free optimization. Optim Methods Softw 24:145\u2013154","journal-title":"Optim Methods Softw"},{"key":"541_CR18","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/151005683","volume":"26","author":"R Garmanjani","year":"2016","unstructured":"Garmanjani R, J\u00fadice D, Vicente LN (2016) Trust-region methods without using derivatives: worst case complexity and the nonsmooth case. SIAM J Optim 26:1987\u20132011","journal-title":"SIAM J Optim"},{"key":"541_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould NIM, Orban D, Toint PhL (2015) CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comp Optim Appl 60:545\u2013557","journal-title":"Comp Optim Appl"},{"key":"541_CR20","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-014-0794-9","volume":"152","author":"GN Grapiglia","year":"2015","unstructured":"Grapiglia GN, Yuan J, Yuan Y-X (2015) On the convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization. Math Program 152:491\u2013520","journal-title":"Math Program"},{"key":"541_CR21","volume-title":"Inequalities","author":"GH Hardy","year":"1934","unstructured":"Hardy GH, Littlewood JE, P\u00f3lya G (1934) Inequalities. Cambridge University Press, New York"},{"key":"541_CR22","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10589-014-9671-y","volume":"60","author":"EW Karas","year":"2015","unstructured":"Karas EW, Santos SA, Svaiter BF (2015) Algebraic rules for quadratic regularization of Newton\u2019s method. Comput Optim Appl 60:343\u2013376","journal-title":"Comput Optim Appl"},{"key":"541_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 (2012) A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization. Comput Optim Appl 51:551\u2013573","journal-title":"Comput Optim Appl"},{"key":"541_CR24","doi-asserted-by":"publisher","first-page":"2447","DOI":"10.1137\/17M1115472","volume":"27","author":"JM Mart\u00ednez","year":"2017","unstructured":"Mart\u00ednez JM (2017) On high-order model regularization for constrained optimization. SIAM J Optim 27:2447\u20132458","journal-title":"SIAM J Optim"},{"key":"541_CR25","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10898-015-0278-3","volume":"53","author":"JM Mart\u00ednez","year":"2015","unstructured":"Mart\u00ednez JM, Raydan M (2015) Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization. J Global Optim 53:319\u2013342","journal-title":"J Global Optim"},{"key":"541_CR26","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 JM, Raydan M (2017) Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization. J Global Optim 68:367\u2013385","journal-title":"J Global Optim"},{"key":"541_CR27","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9 JJ, Wild SM (2009) Benchmarking derivative-free optimization algorithms. SIAM J Optim 20:172\u2013191","journal-title":"SIAM J Optim"},{"key":"541_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 BT (2006) Cubic regularization of Newton method and its global performance. Math Program 108:177\u2013205","journal-title":"Math Program"},{"key":"541_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov Y (2004) Introductory lectures on convex optimization. Kluwer Academic Publishers, Dordrecht"},{"key":"541_CR30","doi-asserted-by":"publisher","first-page":"3512","DOI":"10.1137\/090748536","volume":"20","author":"K Scheinberg","year":"2010","unstructured":"Scheinberg K, Toint PhL (2010) Self-correcting geometry in model-based algorithms for derivative-free unconstrained optimization. SIAM J Optim 20:3512\u20133532","journal-title":"SIAM J Optim"},{"key":"541_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13675-012-0003-7","volume":"1","author":"LN Vicente","year":"2013","unstructured":"Vicente LN (2013) Worst case complexity of direct search. EURO J Comput Optim 1:143\u2013153","journal-title":"EURO J Comput Optim"},{"key":"541_CR32","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10107-019-01405-z","volume":"184","author":"P Xu","year":"2020","unstructured":"Xu P, Roosta F, Mahoney MW (2020) Newton-type methods for non-convex optimization under inexact Hessian information. Math Program 184:35\u201370","journal-title":"Math Program"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-023-00541-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-023-00541-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T12:06:46Z","timestamp":1712059606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-023-00541-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,8]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["541"],"URL":"https:\/\/doi.org\/10.1007\/s10288-023-00541-9","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2023,4,8]]},"assertion":[{"value":"13 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"No potential conflict of interest was reported by the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}