{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:14:56Z","timestamp":1725563696587},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_45","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T14:47:32Z","timestamp":1283352452000},"page":"524-535","source":"Crossref","is-referenced-by-count":2,"title":["Approximating Parameterized Convex Optimization Problems"],"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":[{"issue":"4","key":"45_CR1","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P. Agarwal","year":"2004","unstructured":"Agarwal, P., Har-Peled, S., Varadarajan, K.: Approximating extent measures of points. Journal of the ACM\u00a051(4), 606\u2013635 (2004)","journal-title":"Journal of the ACM"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Har-Peled, S., Yu, H.: Embeddings of surfaces, curves, and moving points in euclidean space. In: SCG 2007: Proceedings of the Twenty-third Annual Symposium on Computational Geometry (2007)","DOI":"10.1145\/1247069.1247135"},{"key":"45_CR3","doi-asserted-by":"crossref","unstructured":"Bach, F., Lanckriet, G., Jordan, M.: Multiple kernel learning, conic duality, and the smo algorithm. In: ICML 2004: Proceedings of the Twenty-first International Conference on Machine Learning (2004)","DOI":"10.1145\/1015330.1015424"},{"issue":"1","key":"45_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.comgeo.2007.04.002","volume":"40","author":"M. B\u0103doiu","year":"2007","unstructured":"B\u0103doiu, M., Clarkson, K.L.: Optimal core-sets for balls. Computational Geometry: Theory and Applications\u00a040(1), 14\u201322 (2007)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"45_CR5","unstructured":"Clarkson, K.L.: Coresets, sparse greedy approximation, and the frank-wolfe algorithm. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (2008)"},{"issue":"2","key":"45_CR6","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1214\/07-AOAS131","volume":"1","author":"J. Friedman","year":"2007","unstructured":"Friedman, J., Hastie, T., H\u00f6fling, H., Tibshirani, R.: Pathwise coordinate optimization. The Annals of Applied Statistics\u00a01(2), 302\u2013332 (2007)","journal-title":"The Annals of Applied Statistics"},{"key":"45_CR7","unstructured":"G\u00e4rtner, B., Giesen, J., Jaggi, M.: An exponential lower bound on the complexity of regularization paths. arXiv, cs.LG (2009)"},{"key":"45_CR8","unstructured":"G\u00e4rtner, B., Giesen, J., Jaggi, M., Welsch, T.: A combinatorial algorithm to compute regularization paths. arXiv, cs.LG (2009)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B., Jaggi, M.: Coresets for polytope distance. In: SCG 2009: Proceedings of the 25th Annual Symposium on Computational Geometry (2009)","DOI":"10.1145\/1542362.1542370"},{"key":"45_CR10","first-page":"1391","volume":"5","author":"T. Hastie","year":"2004","unstructured":"Hastie, T., Rosset, S., Tibshirani, R., Zhu, J.: The entire regularization path for the support vector machine. The Journal of Machine Learning Research\u00a05, 1391\u20131415 (2004)","journal-title":"The Journal of Machine Learning Research"},{"key":"45_CR11","volume-title":"Understanding and Using Linear Programming (Universitext)","author":"J. Matousek","year":"2006","unstructured":"Matousek, J., G\u00e4rtner, B.: Understanding and Using Linear Programming (Universitext). Springer, New York (2006)"},{"issue":"3","key":"45_CR12","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1214\/009053606000001370","volume":"35","author":"S. Rosset","year":"2007","unstructured":"Rosset, S., Zhu, J.: Piecewise linear regularized solution paths. Annals of Statistics\u00a035(3), 1012\u20131030 (2007)","journal-title":"Annals of Statistics"},{"key":"45_CR13","unstructured":"Wu, Z., Zhang, A., Li, C., Sudjianto, A.: Trace solution paths for svms via parametric quadratic programming. In: KDD 2008 DMMT Workshop (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T00:17:39Z","timestamp":1559521059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}