{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T16:04:13Z","timestamp":1772208253546,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,4,25]],"date-time":"2015-04-25T00:00:00Z","timestamp":1429920000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Education, Science, and Sport of the Republic of Slovenia","award":["Programme P2-0246 Algorithms and optimization methods in telecommunications"],"award-info":[{"award-number":["Programme P2-0246 Algorithms and optimization methods in telecommunications"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10589-015-9753-5","type":"journal-article","created":{"date-parts":[[2015,4,24]],"date-time":"2015-04-24T06:40:42Z","timestamp":1429857642000},"page":"693-715","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Mesh adaptive direct search with second directional derivative-based Hessian update"],"prefix":"10.1007","volume":"62","author":[{"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jernej","family":"Olen\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tadej","family":"Tuma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,25]]},"reference":[{"issue":"2","key":"9753_CR1","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/050638382","volume":"17","author":"MA Abramson","year":"2006","unstructured":"Abramson, M.A., Audet, C.: Convergence of mesh adaptive direct search to second-order stationary points. SIAM J. Optim. 17(2), 606\u2013619 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9753_CR2","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"MA Abramson","year":"2009","unstructured":"Abramson, M.A., Audet, C., Dennis Jr, J.E., Le Digabel, S.: OrthoMADS: a deterministic MADS instance with orthogonal directions. SIAM J. Optim. 20(2), 948\u2013966 (2009)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"9753_CR3","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1080\/10556788.2013.808198","volume":"29","author":"MA Abramson","year":"2014","unstructured":"Abramson, M.A., Frimannslund, L., Steihaug, T.: A subclass of generating set search with convergence to second-order stationary points. Optim. Methods Softw. 29(5), 900\u2013918 (2014)","journal-title":"Optim. Methods Softw."},{"key":"9753_CR4","unstructured":"Andersen, M. S., Dahl, J., Vandenberghe, L.: CVXOPT, Release 1.1.6. Available at http:\/\/cvxopt.org\/userguide\/index.html (2014)"},{"issue":"3","key":"9753_CR5","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1137\/S1052623400378742","volume":"13","author":"C Audet","year":"2002","unstructured":"Audet, C., Dennis Jr, J.E.: Analysis of generalized pattern searches. SIAM J. Optim. 13(3), 889\u2013903 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9753_CR6","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis Jr, J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9753_CR7","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis Jr, J.E.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(1), 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9753_CR8","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1137\/120895056","volume":"24","author":"C Audet","year":"2014","unstructured":"Audet, C., Ianni, A., Le Digabel, S., Tribes, C.: Reducing the number of function evaluations in mesh adaptive direct search algorithms. SIAM J. Optim. 24(2), 621\u2013642 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"9753_CR9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10589-005-3912-z","volume":"34","author":"\u00c1 B\u0171rmen","year":"2006","unstructured":"B\u0171rmen, \u00c1., Puhan, J., Tuma, T.: Grid restrained Nelder-Mead algorithm. Comput. Optim. Appl. 34(3), 359\u2013375 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9753_CR10","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1983","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1983)"},{"key":"9753_CR11","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"AR Conn","year":"2009","unstructured":"Conn, A.R., Scheinberg, K., Vincente, L.N.: Introduction to Derivative-Free Optimization. SIAM, Philadelphia (2009)"},{"issue":"1","key":"9753_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1080\/10556788.2011.623162","volume":"28","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Le Digabel, S.: Use of quadratic models with mesh-adaptive direct search for constrained black box optimization. Optim. Methods Softw. 28(1), 139\u2013158 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"9753_CR13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1026429319405","volume":"107","author":"ID Coope","year":"2000","unstructured":"Coope, I.D., Price, C.J.: Frame-based methods for unconstrained optimization. J. Optim. Theory Appl. 107(2), 261\u2013274 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"9753_CR14","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1137\/050646706","volume":"18","author":"AL Cust\u00f3dio","year":"2007","unstructured":"Cust\u00f3dio, A.L., Vincente, L.N.: Using sampling and simplex derivatives in patters search methods. SIAM J. Optim. 18(2), 537\u2013555 (2007)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"9753_CR15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10589-009-9283-0","volume":"46","author":"AL Cust\u00f3dio","year":"2010","unstructured":"Cust\u00f3dio, A.L., Rocha, H., Vincente, L.N.: Incorporating minimum Frobenius norm models in direct search. Comput. Optim. Appl. 46(2), 265\u2013278 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9753_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0801001","volume":"1","author":"WC Davidon","year":"1991","unstructured":"Davidon, W.C.: Variable metric method for minimization. SIAM J. Optim. 1(1), 1\u201317 (1991)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9753_CR17","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10589-007-9038-8","volume":"38","author":"L Frimannslund","year":"2007","unstructured":"Frimannslund, L., Steihaug, T.: A generating set search method using curvature information. Comput. Optim. Appl. 38(1), 105\u2013121 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9753_CR18","doi-asserted-by":"crossref","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Digabel Le","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44:1\u201344:15 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"9753_CR19","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/02331930903100141","volume":"60","author":"D Leventhal","year":"2011","unstructured":"Leventhal, D., Lewis, A.S.: Randomized Hessian estimation and directional search. Optimization 60(3), 329\u2013345 (2011)","journal-title":"Optimization"},{"issue":"1","key":"9753_CR20","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J., Wild, S.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"9753_CR21","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"issue":"3","key":"9753_CR22","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1109\/MCSE.2007.58","volume":"9","author":"TE Oliphant","year":"2007","unstructured":"Oliphant, T.E.: Python for scientific computing. Comput. Sci. Eng. 9(3), 10\u201320 (2007)","journal-title":"Comput. Sci. Eng."},{"issue":"2","key":"9753_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.4153\/CJM-1980-020-7","volume":"32","author":"R Rockafellar","year":"1980","unstructured":"Rockafellar, R.: Generalized directional derivatives and subgradients of nonconvex functions. Can. J. Math. 32(2), 257\u2013280 (1980)","journal-title":"Can. J. Math."},{"issue":"3","key":"9753_CR24","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0717034","volume":"17","author":"GW Stewart","year":"1980","unstructured":"Stewart, G.W.: The efficient generation of random orthogonal matrices with an application to condition estimators. SIAM. J. Numer. Anal. 17(3), 403\u2013409 (1980)","journal-title":"SIAM. J. Numer. Anal."},{"issue":"3","key":"9753_CR25","doi-asserted-by":"crossref","first-page":"805","DOI":"10.1007\/s10957-013-0356-y","volume":"159","author":"B Dyke Van","year":"2013","unstructured":"Van Dyke, B., Asaki, T.J.: Using QR decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions. J. Optim. Theory Appl. 159(3), 805\u2013821 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"9753_CR26","unstructured":"van Rossum, G., et al.: The Python Language Reference. Python Software Foundation, available at http:\/\/docs.python.org\/ (2014)"},{"issue":"1\u20132","key":"9753_CR27","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10107-010-0429-8","volume":"133","author":"L Vincente","year":"2012","unstructured":"Vincente, L., Cust\u00f3dio, A.: Analysis of direct searches for discontinuous functions. Math. Program. 133(1\u20132), 299\u2013325 (2012)","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-015-9753-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-015-9753-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-015-9753-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:39Z","timestamp":1559241459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-015-9753-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,25]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["9753"],"URL":"https:\/\/doi.org\/10.1007\/s10589-015-9753-5","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,25]]}}}