{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T22:41:33Z","timestamp":1776206493008,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10589-024-00590-8","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T12:01:51Z","timestamp":1718884911000},"page":"317-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Q-fully quadratic modeling and its application in a random subspace derivative-free method"],"prefix":"10.1007","volume":"89","author":[{"given":"Yiwen","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4240-3903","authenticated-orcid":false,"given":"Warren","family":"Hare","sequence":"additional","affiliation":[]},{"given":"Amy","family":"Wiebe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"590_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100011","volume":"9","author":"S Alarie","year":"2021","unstructured":"Alarie, S., Audet, C., Gheribi, A.E., Kokkolaras, M., Le Digabel, S.: Two decades of blackbox optimization applications. EURO J. Comput. Optim. 9, 100011 (2021)","journal-title":"EURO J. Comput. Optim."},{"key":"590_CR2","doi-asserted-by":"crossref","unstructured":"Alzantot, M., Sharma, Y., Chakraborty, S., Zhang, H., Hsieh, C., Srivastava, M.B.: GenAttack: practical black-box attacks with gradient-free optimization. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1111\u20131119 (2019)","DOI":"10.1145\/3321707.3321749"},{"key":"590_CR3","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1137\/070707518","volume":"19","author":"C Audet","year":"2008","unstructured":"Audet, C., Dennis, J.E., Jr., Le Digabel, S.: Parallel space decomposition of the mesh adaptive direct search algorithm. SIAM J. Optim. 19, 1150\u20131170 (2008)","journal-title":"SIAM J. Optim."},{"key":"590_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer, Cham (2017)"},{"key":"590_CR5","first-page":"655","volume-title":"Model-Based Methods in Derivative-Free Nonsmooth Optimization","author":"C Audet","year":"2020","unstructured":"Audet, C., Hare, W.: Model-Based Methods in Derivative-Free Nonsmooth Optimization, pp. 655\u2013691. Springer, Cham (2020)"},{"key":"590_CR6","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-022-01836-1","volume":"199","author":"C Cartis","year":"2023","unstructured":"Cartis, C., Roberts, L.: Scalable subspace methods for derivative-free nonlinear least-squares optimization. Math. Program. 199, 461\u2013524 (2023)","journal-title":"Math. Program."},{"key":"590_CR7","doi-asserted-by":"crossref","unstructured":"Chen, P., Zhang, H., Sharma, Y., Yi, J., Hsieh, C.: ZOO: zeroth order optimization based black-box attacks to deep neural networks without training substitute models. In: Proceedings of the 10th ACM Workshop on Artificial Intelligence and Security, pp. 15\u201326 (2017)","DOI":"10.1145\/3128572.3140448"},{"key":"590_CR8","doi-asserted-by":"publisher","first-page":"1821","DOI":"10.1093\/imanum\/drad050","volume":"44","author":"Y Chen","year":"2023","unstructured":"Chen, Y., Hare, W.: Adapting the centred simplex gradient to compensate for misaligned sample points. IMA J. Numer. Anal. 44, 1821\u20131861 (2023)","journal-title":"IMA J. Numer. Anal."},{"key":"590_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.2022.1344","volume":"49","author":"Y Chen","year":"2022","unstructured":"Chen, Y., Hare, W., Jarry-Bolduc, G.: Error analysis of surrogate models constructed through operations on submodels. Math. Oper. Res. 49, 1\u201318 (2022)","journal-title":"Math. Oper. Res."},{"key":"590_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10107-006-0073-5","volume":"111","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of interpolation sets in derivative free optimization. Math. Program. 111, 141\u2013172 (2008)","journal-title":"Math. Program."},{"key":"590_CR11","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1093\/imanum\/drn046","volume":"28","author":"AR Conn","year":"2008","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation. IMA J. Numer. Anal. 28, 721\u2013748 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"590_CR12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-Free Optimization. SIAM, Philadelphia (2009)"},{"key":"590_CR13","unstructured":"Conn, A.R., Toint, P.L., Sartenaer, A., Gould, N.I.M.: On Iterated-Subspace Minimization Methods for Nonlinear Optimization. Tech. Rep., Rutherford Appleton Laboratory (1994)"},{"key":"590_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971200","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"JE Dennis Jr","year":"1996","unstructured":"Dennis, J.E., Jr., Schnabel, R.B.: Numerical Methods for Unconstrained Optimization and Nonlinear Equations. SIAM, Philadelphia (1996)"},{"key":"590_CR15","unstructured":"Dzahini, K.J., Wild, S.M.: Stochastic trust-region algorithm in random subspaces with convergence and expected complexity analyses. arXiv:2207.06452 (2022)"},{"key":"590_CR16","first-page":"3","volume-title":"Hyperparameter Optimization","author":"M Feurer","year":"2019","unstructured":"Feurer, M., Hutter, F.: Hyperparameter Optimization, pp. 3\u201333. Springer, Cham (2019)"},{"key":"590_CR17","doi-asserted-by":"publisher","first-page":"658","DOI":"10.1137\/S1052623496309879","volume":"8","author":"M Fukushima","year":"1998","unstructured":"Fukushima, M.: Parallel variable transformation in unconstrained optimization. SIAM J. Optim. 8, 658\u2013672 (1998)","journal-title":"SIAM J. Optim."},{"key":"590_CR18","unstructured":"Ghanbari, H., Scheinberg, K.: Black-box optimization in machine learning with trust region based derivative free algorithm. arXiv:1703.06925 (2017)"},{"key":"590_CR19","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/s10589-014-9687-3","volume":"60","author":"NIM Gould","year":"2015","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Comput. Optim. Appl. 60, 545\u2013557 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"590_CR20","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s40305-013-0029-4","volume":"1","author":"GN Grapiglia","year":"2013","unstructured":"Grapiglia, G.N., Yuan, J., Yuan, Y.: A subspace version of the Powell\u2013Yuan trust-region algorithm for equality constrained optimization. J. Oper. Res. Soc. China 1, 425\u2013451 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"key":"590_CR21","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25, 1515\u20131541 (2015)","journal-title":"SIAM J. Optim."},{"key":"590_CR22","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s11590-017-1117-x","volume":"11","author":"W Hare","year":"2017","unstructured":"Hare, W.: Compositions of convex functions and fully linear models. Optim. Lett. 11, 1217\u20131227 (2017)","journal-title":"Optim. Lett."},{"key":"590_CR23","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1137\/18M1215864","volume":"30","author":"W Hare","year":"2020","unstructured":"Hare, W., Jarry-Bolduc, G.: Calculus identities for generalized simplex gradients: rules and applications. SIAM J. Optim. 30, 853\u2013884 (2020)","journal-title":"SIAM J. Optim."},{"key":"590_CR24","doi-asserted-by":"publisher","unstructured":"Hare, W., Jarry-Bolduc, G., Planiden, C.: A matrix algebra approach to approximate Hessians. IMA J. Numer. Anal. (2023). https:\/\/doi.org\/10.1093\/imanum\/drad056","DOI":"10.1093\/imanum\/drad056"},{"key":"590_CR25","doi-asserted-by":"crossref","unstructured":"Hare, W., Roberts, L., Royer, C.W.: Expected decrease for derivative-free algorithms using random subspaces. arXiv:2308.04734 (2023)","DOI":"10.1090\/mcom\/4011"},{"key":"590_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Topics in Matrix Analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Topics in Matrix Analysis. Cambridge University Press, Cambridge (1991)"},{"key":"590_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer. 28, 287\u2013404 (2019)","journal-title":"Acta Numer."},{"key":"590_CR28","doi-asserted-by":"publisher","first-page":"6999","DOI":"10.1109\/TNNLS.2021.3084827","volume":"33","author":"Z Li","year":"2021","unstructured":"Li, Z., Liu, F., Yang, W., Peng, S., Zhou, J.: A survey of convolutional neural networks: analysis, applications, and prospects. IEEE Trans. Neural Netw. Learn. Syst. 33, 6999\u20137019 (2021)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"590_CR29","doi-asserted-by":"publisher","first-page":"3012","DOI":"10.1137\/19M125772X","volume":"29","author":"G Liuzzi","year":"2019","unstructured":"Liuzzi, G., Lucidi, S., Rinaldi, F., Vicente, L.N.: Trust-region methods for the derivative-free optimization of nonsmooth black-box functions. SIAM J. Optim. 29, 3012\u20133035 (2019)","journal-title":"SIAM J. Optim."},{"key":"590_CR30","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20, 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"590_CR31","doi-asserted-by":"crossref","unstructured":"Penrose, R.: A generalized inverse for matrices. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol.\u00a051, no.\u00a03, pp.\u00a0406\u2013413. Cambridge University Press (1955)","DOI":"10.1017\/S0305004100030401"},{"key":"590_CR32","first-page":"255","volume-title":"The NEWUOA Software for Unconstrained Optimization without Derivatives","author":"MJD Powell","year":"2006","unstructured":"Powell, M.J.D.: The NEWUOA Software for Unconstrained Optimization without Derivatives, pp. 255\u2013297. Springer, Boston (2006)"},{"key":"590_CR33","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1093\/imanum\/drm047","volume":"28","author":"MJD Powell","year":"2008","unstructured":"Powell, M.J.D.: Developments of NEWUOA for minimization without derivatives. IMA J. Numer. Anal. 28, 649\u2013664 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"590_CR34","unstructured":"Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives. Tech. Rep., University of Cambridge (2009)"},{"key":"590_CR35","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1137\/22M1488569","volume":"33","author":"L Roberts","year":"2023","unstructured":"Roberts, L., Royer, C.W.: Direct search based on probabilistic descent in reduced spaces. SIAM J. Optim. 33, 3057\u20133082 (2023)","journal-title":"SIAM J. Optim."},{"key":"590_CR36","doi-asserted-by":"publisher","first-page":"3555","DOI":"10.1137\/09075531X","volume":"20","author":"H Zhang","year":"2010","unstructured":"Zhang, H., Conn, A.R., Scheinberg, K.: A derivative-free algorithm for least-squares minimization. SIAM J. Optim. 20, 3555\u20133576 (2010)","journal-title":"SIAM J. Optim."},{"key":"590_CR37","unstructured":"Zhang, Z.: On derivative-free optimization methods (in Chinese). PhD thesis, Chinese Academy of Sciences. https:\/\/www.zhangzk.net\/docs\/publications\/thesis.pdf (2012)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00590-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-024-00590-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-024-00590-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,8]],"date-time":"2024-10-08T12:12:04Z","timestamp":1728389524000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-024-00590-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["590"],"URL":"https:\/\/doi.org\/10.1007\/s10589-024-00590-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"8 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest regarding this research.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}