{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:21:25Z","timestamp":1758709285159,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T00:00:00Z","timestamp":1538697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100005416","name":"Norges Forskningsr\u00e5d","doi-asserted-by":"publisher","award":["230303"],"award-info":[{"award-number":["230303"]}],"id":[{"id":"10.13039\/501100005416","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s11590-018-1334-y","type":"journal-article","created":{"date-parts":[[2018,10,5]],"date-time":"2018-10-05T06:19:11Z","timestamp":1538720351000},"page":"1381-1388","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Positive bases with maximal cosine measure"],"prefix":"10.1007","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2497-198X","authenticated-orcid":false,"given":"Geir","family":"N\u00e6vdal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,5]]},"reference":[{"issue":"4","key":"1334_CR1","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1137\/S1052623400377955","volume":"14","author":"P Alberto","year":"2004","unstructured":"Alberto, P., Nogueira, F., Rocha, H., Vicente, L.N.: Pattern search methods for user-provided points: application to molecular geometry problems. SIAM J. Optim. 14(4), 1216\u20131236 (2004)","journal-title":"SIAM J. Optim."},{"key":"1334_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":"1334_CR3","series-title":"Springer Series in Operations Research and Financial Engineering","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, Berlin (2017)"},{"issue":"2","key":"1334_CR4","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/120895056","volume":"24","author":"C Audet","year":"2014","unstructured":"Audet, C., Ianni, A., Digabel, S.L., 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":"1334_CR5","series-title":"MPS-SIAM Series on optimization","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. MPS-SIAM Series on optimization, vol. 8. Society of Industrial and Applied Mathematics and the Mathematical Programming Society, Philadelphia (2009)"},{"issue":"4","key":"1334_CR6","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. Math. J. 76(4), 733\u2013746 (1954)","journal-title":"Am. Math. J."},{"key":"1334_CR7","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1007\/s11590-015-0908-1","volume":"10","author":"M Dodangeh","year":"2016","unstructured":"Dodangeh, M., Vicente, L.N., Zhang, Z.: On the optimal order of worst case complexity of direct search. Optim. Lett. 10, 699\u2013708 (2016)","journal-title":"Optim. Lett."},{"issue":"4","key":"1334_CR8","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(4), 649\u2013654 (2016)","journal-title":"Optim. Lett."},{"key":"1334_CR9","volume-title":"Matrix Analysis","author":"RA Horn","year":"2013","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis, 2nd edn. Cambridge University Press, Cambridge (2013)","edition":"2"},{"issue":"3","key":"1334_CR10","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."},{"key":"1334_CR11","unstructured":"Lewis, R.M., Torczon, V.: Rank ordering and positive bases in pattern search algorithms. NASA Contractor Report 201628, ICASE Report No. 96-71, Institute for Computer Applications in Science and Engineering, NASA Langley Research Center (1999)"},{"key":"1334_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11081-015-9286-x","volume":"17","author":"RG Regis","year":"2016","unstructured":"Regis, R.G.: On the properties of positive spanning sets and positive bases. Optim. Eng. 17, 229\u2013262 (2016)","journal-title":"Optim. Eng."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-018-1334-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-018-1334-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T19:25:07Z","timestamp":1570217107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-018-1334-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,5]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1334"],"URL":"https:\/\/doi.org\/10.1007\/s11590-018-1334-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2018,10,5]]},"assertion":[{"value":"2 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}