{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:43:48Z","timestamp":1757313828699},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11590-010-0229-3","type":"journal-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T04:40:17Z","timestamp":1283229617000},"page":"191-194","source":"Crossref","is-referenced-by-count":12,"title":["A short proof on the cardinality of maximal positive bases"],"prefix":"10.1007","volume":"5","author":[{"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,1]]},"reference":[{"issue":"1","key":"229_CR1","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet C., Dennis J.E. Jr.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"key":"229_CR2","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718768","volume-title":"Introduction to Derivative-Free Optimization. MPS\/SIAM Book Series on Optimization","author":"A.R. Conn","year":"2009","unstructured":"Conn A.R., Scheinberg K., Vicente L.N.: Introduction to Derivative-Free Optimization. MPS\/SIAM Book Series on Optimization. SIAM, Philadelphia (2009)"},{"issue":"2","key":"229_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1023\/A:1013760716801","volume":"21","author":"I.D. 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":"229_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."},{"key":"229_CR5","first-page":"255","volume-title":"Linear inequalities and related systems. Annals of Mathematics Studies, vol. 38","author":"D. Gale","year":"1956","unstructured":"Gale D.: Neighboring vertices on a convex polyhedron. In: Kuhn, H.W, Tucker, A.W. (eds) Linear inequalities and related systems. Annals of Mathematics Studies, vol. 38, pp. 255\u2013263. Princeton University Press, Princeton (1956)"},{"issue":"3","key":"229_CR6","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1023\/A:1017507519943","volume":"109","author":"H.X. Huang","year":"2001","unstructured":"Huang H.X., Pardalos P.M.: New algorithm for the conical combination representation problem of a vector. J. Optim. Theory Appl. 109(3), 495\u2013519 (2001)","journal-title":"J. Optim. Theory Appl."},{"key":"229_CR7","unstructured":"Lewis R.M., Torczon V.: Rank ordering and positive bases in pattern search algorithms. Technical Report TR96-71, ICASE, NASA Langley Research Center (1999)"},{"issue":"1","key":"229_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1112\/jlms\/s2-4.1.165","volume":"s2\u20134","author":"G.C. Shephard","year":"1971","unstructured":"Shephard G.C.: Diagrams for positive bases. J. Lond. Math. Soc. s2\u20134(1), 165\u2013175 (1971)","journal-title":"J. Lond. Math. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0229-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0229-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0229-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:05Z","timestamp":1559574905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0229-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["229"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0229-3","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,1]]}}}