{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:28:57Z","timestamp":1759206537508,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T00:00:00Z","timestamp":1444003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["355571-2013"],"award-info":[{"award-number":["355571-2013"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100009059","name":"Pacific Institute for the Mathematical Sciences","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100009059","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11590-015-0959-3","type":"journal-article","created":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T14:35:38Z","timestamp":1444055738000},"page":"649-654","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the cardinality of positively linearly independent sets"],"prefix":"10.1007","volume":"10","author":[{"given":"W.","family":"Hare","sequence":"first","affiliation":[]},{"given":"H.","family":"Song","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,5]]},"reference":[{"key":"959_CR1","first-page":"2006","volume":"17","author":"C Audet","year":"2004","unstructured":"Audet, C., Dennis, J.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17, 2006 (2004)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"959_CR2","doi-asserted-by":"crossref","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(1), 191\u2013194 (2011)","journal-title":"Optim. Lett."},{"issue":"2","key":"959_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1013760716801","volume":"21","author":"ID Coope","year":"2002","unstructured":"Coope, I.D., Price, C.J.: Positive bases in numerical optimization. Comput. Optim. Appl. 21(2), 169\u2013175 (2002)","journal-title":"Comput. Optim. Appl."},{"key":"959_CR4","doi-asserted-by":"crossref","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."},{"issue":"3","key":"959_CR5","doi-asserted-by":"crossref","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":"959_CR6","unstructured":"Lewis, R.M., Torczon, V.: Rank ordering and positive bases in pattern search algorithms. Technical Report, Institute for Computer Applications in Science and Engineering (ICASE) (1996)"},{"key":"959_CR7","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 317. Springer, Berlin (1998). (Corrected 3rd printing 2009)","DOI":"10.1007\/978-3-642-02431-3"},{"key":"959_CR8","unstructured":"Regis, R.G.: On the properties of positive spanning sets and positive bases. Optimization and Engineering (2015). http:\/\/link.springer.com\/article\/10.1007\/s11081-015-9286-x . (online first)"},{"issue":"4","key":"959_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1112\/jlms\/s2-4.1.165","volume":"2","author":"GC Shephard","year":"1971","unstructured":"Shephard, G.C.: Diagrams for positive bases. J. London Math. Soc. 2(4), 165\u2013175 (1971)","journal-title":"J. London Math. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0959-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0959-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0959-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:17:17Z","timestamp":1589584637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0959-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,5]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["959"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0959-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2015,10,5]]}}}