{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:15Z","timestamp":1725701655562},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_44","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"503-514","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing over the Growing Spectrahedron"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Giesen","sequence":"first","affiliation":[]},{"given":"Martin","family":"Jaggi","sequence":"additional","affiliation":[]},{"given":"S\u00f6ren","family":"Laue","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Hazan, E., Kale, S.: Fast Algorithms for Approximate Semidefinite Programming using the Multiplicative Weights Update Method. In: Proceedings of the Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 339\u2013348 (2005)","DOI":"10.1109\/SFCS.2005.35"},{"issue":"5","key":"44_CR2","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1109\/TIT.2010.2044061","volume":"56","author":"E.J. Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E.J., Tao, T.: The Power of Convex Relaxation: Near-Optimal Matrix Completion. IEEE Transactions on Information Theory\u00a056(5), 2053\u20132080 (2010)","journal-title":"IEEE Transactions on Information Theory"},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Transactions on Algorithms\u00a06(4) (2010)","DOI":"10.1145\/1824777.1824783"},{"key":"44_CR4","doi-asserted-by":"crossref","unstructured":"d\u2019Aspremont, A., Bach, F.R., El Ghaoui, L.: Full Regularization Path for Sparse Principal Component Analysis. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 177\u2013184 (2007)","DOI":"10.1145\/1273496.1273519"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"Fazel, M., Hindi, H., Boyd, S.P.: A Rank Minimization Heuristic with Application to Minimum Order System Approximation. In: Proceedings of the American Control Conference, vol.\u00a06, pp. 4734\u20134739 (2001)","DOI":"10.1109\/ACC.2001.945730"},{"key":"44_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-15775-2_45","volume-title":"Algorithms \u2013 ESA 2010","author":"J. Giesen","year":"2010","unstructured":"Giesen, J., Jaggi, M., Laue, S.: Approximating Parameterized Convex Optimization Problems. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol.\u00a06346, pp. 524\u2013535. Springer, Heidelberg (2010)"},{"key":"44_CR7","unstructured":"Giesen, J., Jaggi, M., Laue, S.: Regularization Paths with Guarantees for Convex Semidefinite Optimization. In: Proceedings International Conference on Artificial Intelligence and Statistics (AISTATS) (2012)"},{"key":"44_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/978-3-540-78773-0_27","volume-title":"LATIN 2008: Theoretical Informatics","author":"E. Hazan","year":"2008","unstructured":"Hazan, E.: Sparse Approximate Solutions to Semidefinite Programs. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 306\u2013316. Springer, Heidelberg (2008)"},{"key":"44_CR9","unstructured":"Jaggi, M., Sulovsk\u00fd, M.: A Simple Algorithm for Nuclear Norm Regularized Problems. In: Proceedings of the International Conference on Machine Learning (ICML), pp. 471\u2013478 (2010)"},{"issue":"8","key":"44_CR10","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1109\/MC.2009.263","volume":"42","author":"Y. Koren","year":"2009","unstructured":"Koren, Y., Bell, R.M., Volinsky, C.: Matrix Factorization Techniques for Recommender Systems. IEEE Computer\u00a042(8), 30\u201337 (2009)","journal-title":"IEEE Computer"},{"issue":"4","key":"44_CR11","doi-asserted-by":"publisher","first-page":"1094","DOI":"10.1137\/0613066","volume":"13","author":"J. Kuczy\u0144ski","year":"1992","unstructured":"Kuczy\u0144ski, J., Wo\u017aniakowski, H.: Estimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start. SIAM Journal on Matrix Analysis and Applications\u00a013(4), 1094\u20131122 (1992)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"44_CR12","first-page":"2287","volume":"11","author":"R. Mazumder","year":"2010","unstructured":"Mazumder, R., Hastie, T., Tibshirani, R.: Spectral Regularization Algorithms for Learning Large Incomplete Matrices. Journal of Machine Learning Research\u00a011, 2287\u20132322 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"44_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A. Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with Rate of Convergence O(1\/T) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-concave Saddle Point Problems. SIAM Journal on Optimization\u00a015, 229\u2013251 (2004)","journal-title":"SIAM Journal on Optimization"},{"issue":"2","key":"44_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y. Nesterov","year":"2007","unstructured":"Nesterov, Y.: Smoothing Technique and its Applications in Semidefinite Optimization. Math. Program.\u00a0110(2), 245\u2013259 (2007)","journal-title":"Math. Program."},{"key":"44_CR15","unstructured":"Salakhutdinov, R., Srebro, N.: Collaborative Filtering in a Non-Uniform World: Learning with the Weighted Trace Norm. In: Proceedings of Advances in Neural Information Processing Systems (NIPS), vol. 23 (2010)"},{"key":"44_CR16","unstructured":"Srebro, N., Rennie, J.D.M., Jaakkola, T.: Maximum-Margin Matrix Factorization. In: Proceedings of Advances in Neural Information Processing Systems (NIPS), vol.\u00a017 (2004)"},{"key":"44_CR17","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating Direction Augmented Lagrangian Methods for Semidefinite Programming. Technical report (2009)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T19:07:37Z","timestamp":1643310457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}