{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:16:53Z","timestamp":1757618213975,"version":"3.44.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T00:00:00Z","timestamp":1749168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["2018-03865","2020-04448","2025-00063"],"award-info":[{"award-number":["2018-03865","2020-04448","2025-00063"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10589-025-00701-z","type":"journal-article","created":{"date-parts":[[2025,6,6]],"date-time":"2025-06-06T10:57:30Z","timestamp":1749207450000},"page":"125-153","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The cosine measure relative to a subspace"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3043-5393","authenticated-orcid":false,"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4240-3903","authenticated-orcid":false,"given":"Warren","family":"Hare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1827-8508","authenticated-orcid":false,"given":"Gabriel","family":"Jarry-Bolduc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,6]]},"reference":[{"key":"701_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s11590-010-0229-3","volume":"5","author":"C Audet","year":"2011","unstructured":"Audet, C.: A short proof on the cardinality of maximal positive bases. Optim. Lett. 5, 191\u2013194 (2011)","journal-title":"Optim. Lett."},{"key":"701_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"701_CR3","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1137\/070707518","volume":"19","author":"C Audet","year":"2008","unstructured":"Audet, C., Dennis, J., 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":"701_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 Series in Operations Research and Financial Engineering, Springer, Cham, Switzerland (2017)"},{"key":"701_CR5","volume-title":"A Second Course in Linear Algebra","author":"W Brown","year":"1988","unstructured":"Brown, W.: A Second Course in Linear Algebra. Wiley, New Jersey (1988)"},{"key":"701_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":"701_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization","author":"A Conn","year":"2009","unstructured":"Conn, A., Scheinberg, K., Vicente, L.: Introduction to Derivative-Free Optimization. SIAM (2009)"},{"key":"701_CR8","doi-asserted-by":"publisher","first-page":"733","DOI":"10.2307\/2372648","volume":"76","author":"C Davis","year":"1954","unstructured":"Davis, C.: Theory of positive linear dependence. Am. J. Math. 76, 733\u2013746 (1954)","journal-title":"Am. J. Math."},{"key":"701_CR9","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1137\/S1052623400374495","volume":"14","author":"E Dolan","year":"2003","unstructured":"Dolan, E., Lewis, R., Torczon, V.: On the local convergence of pattern search. SIAM J. Optim. 14, 567\u2013583 (2003)","journal-title":"SIAM J. Optim."},{"key":"701_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10589-019-00062-4","volume":"72","author":"S Gratton","year":"2019","unstructured":"Gratton, S., Royer, C., Vicente, L., Zhang, Z.: Direct search based on probabilistic feasible descent for bound and linearly constrained problems. Comput. Optim. Appl. 72, 525\u2013559 (2019)","journal-title":"Comput. Optim. Appl."},{"key":"701_CR11","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1007\/s11590-020-01587-y","volume":"14","author":"W Hare","year":"2020","unstructured":"Hare, W., Jarry-Bolduc, G.: A deterministic algorithm to compute the cosine measure of a finite positive spanning set. Optim. Lett. 14, 1305\u20131316 (2020)","journal-title":"Optim. Lett."},{"key":"701_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.laa.2023.10.006","volume":"680","author":"W Hare","year":"2024","unstructured":"Hare, W., Jarry-Bolduc, G., Kerleau, S., Royer, C.: Using orthogonally structured positive bases for constructing positive $$k$$-spanning sets with cosine measure guarantees. Linear Algebra Appl. 680, 183\u2013207 (2024)","journal-title":"Linear Algebra Appl."},{"key":"701_CR13","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1007\/s11590-023-01973-2","volume":"17","author":"W Hare","year":"2023","unstructured":"Hare, W., Jarry-Bolduc, G., Planiden, C.: Nicely structured positive bases with maximal cosine measure. Optim. Lett. 17, 1495\u20131515 (2023)","journal-title":"Optim. Lett."},{"key":"701_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s11228-016-0394-3","volume":"26","author":"W Hare","year":"2018","unstructured":"Hare, W., Planiden, C.: Computing proximal points of convex functions with inexact subgradients. Set-Valued and Variational Analysis 26, 469\u2013492 (2018)","journal-title":"Set-Valued and Variational Analysis"},{"key":"701_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/s11590-015-0959-3","volume":"10","author":"W Hare","year":"2016","unstructured":"Hare, W., Song, H.: On the cardinality of positively linearly independent sets. Optim. Lett. 10, 649\u2013654 (2016)","journal-title":"Optim. Lett."},{"key":"701_CR16","volume-title":"Fundamentals of convex analysis","author":"J Hiriart-Urruty","year":"2004","unstructured":"Hiriart-Urruty, J., Lemar\u00e9chal, C.: Fundamentals of convex analysis. Springer, New York (2004)"},{"issue":"4","key":"701_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3618297","volume":"49","author":"M Kimiaei","year":"2023","unstructured":"Kimiaei, M., Neumaier, A., Faramarzi, P.: New subspace method for unconstrained derivative-free optimization. ACM Trans. Math. Softw. 49(4), 1\u201328 (2023)","journal-title":"ACM Trans. Math. Softw."},{"key":"701_CR18","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/S003614450242889","volume":"45","author":"T Kolda","year":"2003","unstructured":"Kolda, T., Lewis, R., Torczon, V.: Optimization by direct search: new perspectives on some classical and modern methods. SIAM Rev. 45, 385\u2013482 (2003)","journal-title":"SIAM Rev."},{"key":"701_CR19","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10589-021-00271-w","volume":"79","author":"D Kozak","year":"2021","unstructured":"Kozak, D., Becker, S., Doostan, A., Tenorio, L.: A stochastic subspace approach to gradient-free optimization in high dimensions. Comput. Optim. Appl. 79, 339\u2013368 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"701_CR20","unstructured":"Lewis, R., Torczon V.: Rank ordering and positive bases in pattern search algorithms, Tech. Rep. TR96-71, ICASE, NASA Langley Research Center (1996)"},{"key":"701_CR21","doi-asserted-by":"publisher","first-page":"1381","DOI":"10.1007\/s11590-018-1334-y","volume":"13","author":"G N\u00e6vdal","year":"2018","unstructured":"N\u00e6vdal, G.: Positive bases with maximal cosine measure. Optim. Lett. 13, 1381\u20131388 (2018)","journal-title":"Optim. Lett."},{"key":"701_CR22","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11081-015-9286-x","volume":"17","author":"R Regis","year":"2016","unstructured":"Regis, R.: On the properties of positive spanning sets and positive bases. Optim. Eng. 17, 229\u2013262 (2016)","journal-title":"Optim. Eng."},{"key":"701_CR23","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1007\/s10589-020-00253-4","volume":"78","author":"R Regis","year":"2021","unstructured":"Regis, R.: On the properties of the cosine measure and the uniform angle subspace. Comput. Optim. Appl. 78, 915\u2013952 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"701_CR24","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton, New Jersey (1970)"},{"key":"701_CR25","volume-title":"Advanced Linear Algebra","author":"S Roman","year":"2007","unstructured":"Roman, S.: Advanced Linear Algebra, 3rd edn. Springer, New York (2007)","edition":"3"},{"key":"701_CR26","doi-asserted-by":"publisher","first-page":"557","DOI":"10.4064\/am-19-3-4-557-567","volume":"19","author":"Z Romanowicz","year":"1987","unstructured":"Romanowicz, Z.: Geometric structure of positive bases in linear spaces. Applicationes Mathematicae 19, 557\u2013567 (1987)","journal-title":"Applicationes Mathematicae"},{"key":"701_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7, 1\u201325 (1997)","journal-title":"SIAM J. Optim."},{"key":"701_CR28","unstructured":"Xie, P., Yuan, Y.: A new two-dimensional model-based subspace method for large-scale unconstrained derivative-free optimization: 2d-mosub, arXiv preprint arXiv:2309.14855, (2023)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00701-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-025-00701-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-025-00701-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T18:40:46Z","timestamp":1757184046000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-025-00701-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,6]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s10589-025-00701-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2025,6,6]]},"assertion":[{"value":"19 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2025","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 Conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}