{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:24:27Z","timestamp":1740122667052,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T00:00:00Z","timestamp":1569196800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004329","name":"Slovenian Research Agency","doi-asserted-by":"crossref","award":["P2-0246"],"award-info":[{"award-number":["P2-0246"]}],"id":[{"id":"10.13039\/501100004329","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10589-019-00133-6","type":"journal-article","created":{"date-parts":[[2019,9,23]],"date-time":"2019-09-23T13:02:41Z","timestamp":1569243761000},"page":"645-667","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mesh adaptive direct search with simplicial Hessian update"],"prefix":"10.1007","volume":"74","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3035-1376","authenticated-orcid":false,"given":"\u00c1rp\u00e1d","family":"B\u0171rmen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4416-5432","authenticated-orcid":false,"given":"Iztok","family":"Fajfar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"issue":"2","key":"133_CR1","doi-asserted-by":"publisher","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":"133_CR2","doi-asserted-by":"publisher","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":"1","key":"133_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ejor.2017.10.058","volume":"268","author":"N Amaioua","year":"2018","unstructured":"Amaioua, N., Audet, C., Conn, A.R., Le Digabel, S.: Efficient solution of quadratically constrained quadratic subproblems within a direct-search algorithm. Eur. J. Oper. Res. 268(1), 13\u201324 (2018)","journal-title":"Eur. J. Oper. Res."},{"key":"133_CR4","unstructured":"Andersen, M.S., Dahl, J., Vandenberghe, L.: CVXOPT, Release 1.1.6. \nhttp:\/\/cvxopt.org\/userguide\/index.html\n\n (2016)"},{"issue":"1","key":"133_CR5","doi-asserted-by":"publisher","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":"133_CR6","doi-asserted-by":"publisher","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":"133_CR7","doi-asserted-by":"publisher","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."},{"key":"133_CR8","volume-title":"Measure Theory","author":"VI Bogachev","year":"2006","unstructured":"Bogachev, V.I.: Measure Theory. Springer, Berlin (2006)"},{"issue":"3","key":"133_CR9","doi-asserted-by":"publisher","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\u2013Mead algorithm. Comput. Optim. Appl. 34(3), 359\u2013375 (2006)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"133_CR10","first-page":"813","volume":"12","author":"\u00c1 B\u0171rmen","year":"2016","unstructured":"B\u0171rmen, \u00c1., Tuma, T.: Generating poll directions for mesh adaptive direct search with realizations of a uniformly distributed random orthogonal matrix. Pac. J. Optim. 12(4), 813\u2013832 (2016)","journal-title":"Pac. J. Optim."},{"key":"133_CR11","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s10589-015-9753-5","volume":"62","author":"\u00c1 B\u0171rmen","year":"2015","unstructured":"B\u0171rmen, \u00c1., Olen\u0161ek, J., Tuma, T.: Mesh adaptive direct search with second directional derivative-based Hessian update. Comput. Optim. Appl. 62, 693\u2013715 (2015)","journal-title":"Comput. Optim. Appl."},{"key":"133_CR12","volume-title":"Optimization and Nonsmooth Analysis","author":"F Clarke","year":"1983","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. SIAM, Philadelphia (1983)"},{"issue":"1","key":"133_CR13","doi-asserted-by":"publisher","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":"133_CR14","doi-asserted-by":"publisher","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":"133_CR15","doi-asserted-by":"publisher","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."},{"key":"133_CR16","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., Vincente, L.N.: Introduction to Derivative-Free Optimization. SIAM, Philadelphia (2009)"},{"issue":"1","key":"133_CR17","doi-asserted-by":"publisher","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."},{"key":"133_CR18","volume-title":"Analog Design Centering and Sizing","author":"HE Graeb","year":"2007","unstructured":"Graeb, H.E.: Analog Design Centering and Sizing. Springer, Berlin (2007)"},{"issue":"3","key":"133_CR19","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"TG Kolda","year":"2003","unstructured":"Kolda, T.G., Lewis, R.M., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45(3), 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"issue":"4","key":"133_CR20","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","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."},{"key":"133_CR21","doi-asserted-by":"publisher","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, 329\u2013345 (2011)","journal-title":"Optimization"},{"issue":"1","key":"133_CR22","doi-asserted-by":"publisher","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":"133_CR23","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (2006)"},{"issue":"3","key":"133_CR24","doi-asserted-by":"publisher","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."},{"key":"133_CR25","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-003-0490-7","volume":"100","author":"MJD Powell","year":"2004","unstructured":"Powell, M.J.D.: Least Frobenius norm updating of quadratic models that satisfy interpolation conditions. Math. Prog. 100, 183\u2013215 (2004)","journal-title":"Math. Prog."},{"issue":"2","key":"133_CR26","doi-asserted-by":"publisher","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":"133_CR27","doi-asserted-by":"publisher","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":"133_CR28","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10957-013-0356-y","volume":"159","author":"B Van Dyke","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 App. 159(3), 805\u2013821 (2013)","journal-title":"J. Optim. Theory App."},{"key":"133_CR29","unstructured":"Van Rossum, G., et al: The Python language reference. Python Software Foundation (2014). \nhttp:\/\/docs.python.org\/"},{"issue":"1\u20132","key":"133_CR30","doi-asserted-by":"publisher","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. Prog. 133(1\u20132), 299\u2013325 (2012)","journal-title":"Math. Prog."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00133-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00133-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00133-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T23:12:23Z","timestamp":1600729943000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00133-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9,23]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["133"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00133-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,9,23]]},"assertion":[{"value":"20 April 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}