{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T20:13:04Z","timestamp":1775074384550,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T00:00:00Z","timestamp":1675036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T00:00:00Z","timestamp":1675036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The properties of positive bases make them a useful tool in derivative-free optimization and an interesting concept in mathematics. The notion of the<jats:italic>cosine measure<\/jats:italic>helps to quantify the quality of a positive basis. It provides information on how well the vectors in the positive basis uniformly cover the space considered. The number of vectors in a positive basis is known to be between<jats:inline-formula><jats:alternatives><jats:tex-math>$$n+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>+<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and 2<jats:italic>n<\/jats:italic>inclusively. When the number of vectors is strictly between<jats:inline-formula><jats:alternatives><jats:tex-math>$$n+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>+<\/mml:mo><mml:mn>1<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and 2<jats:italic>n<\/jats:italic>, we say that it is an intermediate positive basis. In this paper, the structure of intermediate positive bases with maximal cosine measure is investigated. The structure of an intermediate positive basis with maximal cosine measure over a certain subset of positive bases is provided. This type of positive bases has a simple structure that makes them easy to generate with a computer software.<\/jats:p>","DOI":"10.1007\/s11590-023-01973-2","type":"journal-article","created":{"date-parts":[[2023,1,30]],"date-time":"2023-01-30T13:04:37Z","timestamp":1675083877000},"page":"1495-1515","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nicely structured positive bases with maximal cosine measure"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4240-3903","authenticated-orcid":false,"given":"Warren","family":"Hare","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1827-8508","authenticated-orcid":false,"given":"Gabriel","family":"Jarry-Bolduc","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0412-8445","authenticated-orcid":false,"given":"Chayne","family":"Planiden","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,30]]},"reference":[{"key":"1973_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"M Abramson","year":"2009","unstructured":"Abramson, M., Audet, C., Dennis, J., Le Digabel, S.: Orthomads: a deterministic mads instance with orthogonal directions. SIAM J. Optim. 20, 948\u2013966 (2009)","journal-title":"SIAM J. Optim."},{"key":"1973_CR2","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":"1973_CR3","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":"1973_CR4","doi-asserted-by":"crossref","unstructured":"Audet, C., Hare, W.: In: Derivative-free and blackbox optimization. Springer Series in Operations Research and Financial Engineering, Springer, Cham (2017)","DOI":"10.1007\/978-3-319-68913-5"},{"key":"1973_CR5","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, 621\u2013642 (2014)","journal-title":"SIAM J. Optim."},{"key":"1973_CR6","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/18M1217760","volume":"30","author":"A Beck","year":"2020","unstructured":"Beck, A., Hallak, N.: On the convergence to stationary points of deterministic and randomized feasible descent directions methods. SIAM J. Optim. 30, 56\u201379 (2020)","journal-title":"SIAM J. Optim."},{"key":"1973_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, vol. 8. SIAM, Philadelphia (2009)"},{"key":"1973_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1137\/S1052623499354989","volume":"11","author":"I Coope","year":"2001","unstructured":"Coope, I., Price, C.: On the convergence of grid-based methods for unconstrained optimization. SIAM J. Optim. 11, 859\u2013869 (2001)","journal-title":"SIAM J. Optim."},{"key":"1973_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1013760716801","volume":"21","author":"I Coope","year":"2002","unstructured":"Coope, I., Price, C.: Positive bases in numerical optimization. Comput. Optim. Appl. 21, 169\u2013175 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"1973_CR10","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1093\/imanum\/drn045","volume":"28","author":"A Cust\u00f3dio","year":"2008","unstructured":"Cust\u00f3dio, A., Dennis, J., Vicente, L.: Using simplex gradients of nonsmooth functions in direct search methods. IMA J. Numer. Anal. 28, 770\u2013784 (2008)","journal-title":"IMA J. Numer. Anal."},{"key":"1973_CR11","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":"1973_CR12","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":"1973_CR13","volume-title":"Matrix analysis","author":"R Horn","year":"1990","unstructured":"Horn, R., Johnson, C.: Matrix analysis. Cambridge University Press, Cambridge (1990)"},{"issue":"6","key":"1973_CR14","first-page":"1","volume":"14","author":"G Jarry-Bolduc","year":"2019","unstructured":"Jarry-Bolduc, G., Nadeau, P., Singh, S.: Uniform simplex of an arbitrary orientation. Optim. Lett. 14(6), 1\u201311 (2019)","journal-title":"Optim. Lett."},{"key":"1973_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971903","volume-title":"Implicit filtering","author":"C Kelley","year":"2011","unstructured":"Kelley, C.: Implicit filtering. SIAM, Philadelphia (2011)"},{"key":"1973_CR16","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":"1973_CR17","unstructured":"Lewis, R., Torczon, V.: Rank ordering and positive bases in pattern search algorithms., tech. rep., Institute for Computer Applications in Science and Engineering, Hampton VA, (1996)"},{"key":"1973_CR18","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0898-1221(01)00278-4","volume":"43","author":"T Lu","year":"2002","unstructured":"Lu, T., Shiou, S.: Inverses of 2$$\\times$$ 2 block matrices. Comput. Math. Appl. 43, 119\u2013129 (2002)","journal-title":"Comput. Math. Appl."},{"key":"1973_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1090\/S0002-9947-1962-0147879-X","volume":"103","author":"R McKinney","year":"1962","unstructured":"McKinney, R.: Positive bases for linear spaces. Trans. Am. Math. Soc. 103, 131\u2013148 (1962)","journal-title":"Trans. Am. Math. Soc."},{"key":"1973_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-018-1334-y","author":"G N\u00e6vdal","year":"2018","unstructured":"N\u00e6vdal, G.: Positive bases with maximal cosine measure. Optim. Lett. (2018). https:\/\/doi.org\/10.1007\/s11590-018-1334-y","journal-title":"Optim. Lett."},{"key":"1973_CR21","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":"1973_CR22","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":"1973_CR23","first-page":"557","volume":"19","author":"Z Romanowicz","year":"1987","unstructured":"Romanowicz, Z.: Geometric structure of positive bases in linear spaces. Appl. Math. 19, 557\u2013567 (1987)","journal-title":"Appl. Math."},{"key":"1973_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1112\/jlms\/s2-4.1.165","volume":"2","author":"G Shephard","year":"1971","unstructured":"Shephard, G.: Diagrams for positive bases. J. London Math. Soc. 2, 165\u2013175 (1971)","journal-title":"J. London Math. Soc."},{"key":"1973_CR25","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":"1973_CR26","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.: Using qr decomposition to obtain a new instance of mesh adaptive direct search with uniformly distributed polling directions. J. Optim. Theor. Appl. 159, 805\u2013821 (2013)","journal-title":"J. Optim. Theor. Appl."},{"key":"1973_CR27","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1080\/10556780902909948","volume":"24","author":"A Vaz","year":"2009","unstructured":"Vaz, A., Vicente, L.: Pswarm: a hybrid solver for linearly constrained global derivative-free optimization. Optim. Methods Softw. 24, 669\u2013685 (2009)","journal-title":"Optim. Methods Softw."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01973-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-01973-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-01973-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T21:25:50Z","timestamp":1701811550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-01973-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,30]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["1973"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-01973-2","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,30]]},"assertion":[{"value":"15 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Funding note has been updated in the original version","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}]}}