{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T17:18:39Z","timestamp":1722791919532},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,14]],"date-time":"2015-02-14T00:00:00Z","timestamp":1423872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10208-015-9248-x","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T09:18:34Z","timestamp":1424164714000},"page":"369-394","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Convex Optimization on Banach Spaces"],"prefix":"10.1007","volume":"16","author":[{"given":"R. A.","family":"DeVore","sequence":"first","affiliation":[]},{"given":"V. N.","family":"Temlyakov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,14]]},"reference":[{"key":"9248_CR1","doi-asserted-by":"crossref","unstructured":"J.M. Borwein and A.S. Lewis, Convex Analysis and Nonlinear Optimization. Theory and Examples, Canadian Mathematical Society, Springer, 2006.","DOI":"10.1007\/978-0-387-31256-9"},{"key":"9248_CR2","doi-asserted-by":"crossref","unstructured":"V. Chandrasekaran, B. Recht, P.A. Parrilo, and A.S. Willsky, The convex geometry of linear inverse problems, Proceedings of the 48th Annual Allerton Conference on Communication, Control and Computing, 2010, 699\u2013703.","DOI":"10.1109\/ALLERTON.2010.5706975"},{"key":"9248_CR3","doi-asserted-by":"crossref","unstructured":"K.L. Clarkson, Coresets, Sparse Greedy Approximation, and the Frank\u2013Wolfe Algorithm, ACM Transactions on Algorithms, 6 (2010), Article No. 63.","DOI":"10.1145\/1824777.1824783"},{"key":"9248_CR4","unstructured":"M. Dudik, Z. Harchaoui, and J. Malick, Lifted coordinate descent for learning with trace-norm regularization, In AISTATS, 2012."},{"key":"9248_CR5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"M. Frank and P. Wolfe, An algorithm for quadratic programming, Naval Research Logistics Quarterly, 3 (1956), 95\u2013110.","journal-title":"Naval Research Logistics Quarterly"},{"key":"9248_CR6","unstructured":"M. Jaggi, Sparse Convex Optimization Methods for Ma- chine Learning, PhD thesis, ETH Z\u00fcrich, 2011."},{"key":"9248_CR7","unstructured":"M. Jaggi, Revisiting Frank\u2013Wolfe: Projection-Free Sparse Convex Optimization, Proceedings of the $$30^{th}$$ 30 th International Conference on Machine Learning, Atlanta, Georgia, USA, 2013."},{"key":"9248_CR8","unstructured":"M. Jaggi and M. Sulovsk\u00fd, A Simple Algorithm for Nuclear Norm Regularized Problems. ICML, 2010."},{"key":"9248_CR9","volume-title":"Mathematical Programming","author":"VG Karmanov","year":"1989","unstructured":"V.G. Karmanov, Mathematical Programming, Mir Publishers, Moscow, 1989."},{"key":"9248_CR10","unstructured":"A. Nemirovski, Optimization II: Numerical methods for nonlinear continuous optimization, Lecture Notes, Israel Institute of Technology, 1999."},{"key":"9248_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Yu Nesterov","year":"2004","unstructured":"Yu. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, Kluwer Academic Publishers, Boston, 2004."},{"key":"9248_CR12","unstructured":"H. Nguyen and G. Petrova, Greedy strategies for convex optimization, arXiv:1401.1754v1 [math.NA] 8 Jan 2014."},{"issue":"6","key":"9248_CR13","doi-asserted-by":"crossref","first-page":"2807","DOI":"10.1137\/090759574","volume":"20","author":"S Shalev-Shwartz","year":"2010","unstructured":"S. Shalev-Shwartz, N. Srebro, and T. Zhang, Trading accuracy for sparsity in optimization problems with sparsity constrains, SIAM Journal on Optimization, 20(6) (2010), 2807\u20132832.","journal-title":"SIAM Journal on Optimization"},{"key":"9248_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1006\/jath.1998.3265","volume":"98","author":"VN Temlyakov","year":"1999","unstructured":"V.N. Temlyakov, Greedy Algorithms and $$m$$ m -term Approximation With Regard to Redundant Dictionaries, J. Approx. Theory 98 (1999), 117\u2013145.","journal-title":"J. Approx. Theory"},{"key":"9248_CR15","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00365-004-0565-6","volume":"21","author":"VN Temlyakov","year":"2005","unstructured":"V.N. Temlyakov, Greedy-Type Approximation in Banach Spaces and Applications, Constr. Approx., 21 (2005), 257\u2013292.","journal-title":"Constr. Approx."},{"key":"9248_CR16","doi-asserted-by":"crossref","unstructured":"V.N. Temlyakov, Greedy approximation, Cambridge University Press, 2011.","DOI":"10.1017\/CBO9780511762291"},{"key":"9248_CR17","doi-asserted-by":"crossref","unstructured":"V.N. Temlyakov, Greedy approximation in convex optimization, IMI Preprint, 2012:03, 1\u201325; arXiv:1206.0392v1 , 2 Jun 2012 (to appear in Constructive Approximation).","DOI":"10.1007\/s00365-006-0652-5"},{"key":"9248_CR18","doi-asserted-by":"crossref","unstructured":"V.N. Temlyakov, Greedy expansions in convex optimization, Proceedings of the Steklov Institute of Mathematics, 284 (2014), 244\u2013262 ( arXiv:1206.0393v1 , 2 Jun 2012).","DOI":"10.1134\/S0081543814010180"},{"key":"9248_CR19","unstructured":"A. Tewari, P. Ravikumar, and I.S. Dhillon, Greedy Algorithms for Structurally Constrained High Dimensional Problems, prerint, (2012), 1\u201310."},{"issue":"3","key":"9248_CR20","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1109\/TIT.2002.808136","volume":"49","author":"T Zhang","year":"2003","unstructured":"T. Zhang, Sequential greedy approximation for certain convex optimization problems, IEEE Transactions on Information Theory, 49(3) (2003), 682\u2013691.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9248-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9248-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9248-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T22:09:43Z","timestamp":1651270183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9248-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,14]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["9248"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9248-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,14]]}}}