{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T00:56:45Z","timestamp":1768006605108,"version":"3.49.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T00:00:00Z","timestamp":1397779200000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s10107-014-0778-9","type":"journal-article","created":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T22:54:23Z","timestamp":1397775263000},"page":"75-112","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":63,"title":["Conditional gradient algorithms for norm-regularized smooth convex optimization"],"prefix":"10.1007","volume":"152","author":[{"given":"Zaid","family":"Harchaoui","sequence":"first","affiliation":[]},{"given":"Anatoli","family":"Juditsky","sequence":"additional","affiliation":[]},{"given":"Arkadi","family":"Nemirovski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,4,18]]},"reference":[{"key":"778_CR1","unstructured":"Andersen, E.D., Andersen, K.D.: The MOSEK optimization tools manual. http:\/\/www.mosek.com\/fileadmin\/products\/6_0\/tools\/doc\/pdf\/tools.pdf"},{"key":"778_CR2","doi-asserted-by":"crossref","unstructured":"Bach, F., Jenatton, R., Mairal, J., Obozinski, G. et al.: Convex optimization with sparsity-inducing norms. In: Sra, S., Nowozin, S., Wright, S. J. (eds). Optimization for Machine Learning, pp. 19\u201353. MIT Press","DOI":"10.7551\/mitpress\/8996.003.0004"},{"issue":"4","key":"778_CR3","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2008","unstructured":"Cai, J.-F., Candes, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20(4), 1956\u20131982 (2008)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"778_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/s10208-009-9045-5","volume":"9","author":"E Cand\u00e8s","year":"2009","unstructured":"Cand\u00e8s, E., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9(6), 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"778_CR5","doi-asserted-by":"crossref","unstructured":"Cox, B., Juditsky, A., Nemirovski, A.: Dual subgradient algorithms for large-scale nonsmooth learning problems. Math. Program. 1\u201338 (2013). doi: 10.1007\/s10107-013-0725-1","DOI":"10.1007\/s10107-013-0725-1"},{"key":"778_CR6","volume-title":"Approximate Methods in Optimization Problems","author":"V Demyanov","year":"1970","unstructured":"Demyanov, V., Rubinov, A.: Approximate Methods in Optimization Problems. American Elsevier, Amsterdam (1970)"},{"key":"778_CR7","unstructured":"Dudik, M., Harchaoui, Z., Malick, J.: Lifted coordinate descent for learning with trace-norm regularization. In: AISTATS (2012)"},{"issue":"2","key":"778_CR8","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1016\/0022-247X(78)90137-3","volume":"62","author":"JC Dunn","year":"1978","unstructured":"Dunn, J.C., Harshbarger, S.: Conditional gradient algorithms with open loop step size rules. J. Math. Anal. Appl. 62(2), 432\u2013444 (1978)","journal-title":"J. Math. Anal. Appl."},{"key":"778_CR9","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Naval Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Naval Res. Logist. Q."},{"key":"778_CR10","doi-asserted-by":"crossref","unstructured":"Goldfarb, D., Ma, S., Wen, Z.: Solving low-rank matrix completion problems efficiently. In: Proceedings of 47th Annual Allerton Conference on Communication, Control, and Computing (2009)","DOI":"10.1109\/ALLERTON.2009.5394884"},{"key":"778_CR11","doi-asserted-by":"crossref","unstructured":"Harchaoui, Z., Douze, M., Paulin, M., Dudik, M., Malick, J.: Large-scale image classification with trace-norm regularization. In: CVPR (2012)","DOI":"10.1109\/CVPR.2012.6248078"},{"key":"778_CR12","unstructured":"Harchaoui, Z., Juditsky, A., Nemirovski, A.: Conditional gradient algorithms for machine learning. In: NIPS Workshop on Optimization for Machine Learning. http:\/\/opt.kyb.tuebingen.mpg.de\/opt12\/papers.html (2012)"},{"key":"778_CR13","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning. Springer Series in Statistics. Springer, Berlin (2008)","DOI":"10.1007\/978-0-387-84858-7"},{"key":"778_CR14","doi-asserted-by":"crossref","unstructured":"Hazan, E.: Sparse approximate solutions to semidefinite programs. In: Proceedings of the 8th Latin American Conference Theoretical Informatics, pp. 306\u2013316 (2008)","DOI":"10.1007\/978-3-540-78773-0_27"},{"key":"778_CR15","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BFb0121181","volume":"31","author":"D Hearn","year":"1987","unstructured":"Hearn, D., Lawphongpanich, S., Ventura, J.: Restricted simplicial decomposition: computation and extensions. Math. Program. Stud. 31, 99\u2013118 (1987)","journal-title":"Math. Program. Stud."},{"key":"778_CR16","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580219","volume":"6","author":"C Holloway","year":"1974","unstructured":"Holloway, C.: An extension of the Frank-Wolfe method of feasible directions. Math. Program. 6, 14\u201327 (1974)","journal-title":"Math. Program."},{"key":"778_CR17","unstructured":"Jaggi, M.: Revisiting Frank-Wolfe: projection-free sparse convex optimization. In: ICML (2013)"},{"key":"778_CR18","unstructured":"Jaggi, M., Sulovsky, M.: A simple algorithm for nuclear norm regularized problems. In: ICML (2010)"},{"issue":"1\u20132","key":"778_CR19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-012-0575-2","volume":"142","author":"A Juditsky","year":"2013","unstructured":"Juditsky, A., Karzan, F.K., Nemirovski, A.: Randomized first order algorithms with applications to $$\\ell _1$$ \u2113 1 -minimization. Math. Program. 142(1\u20132), 269\u2013310 (2013)","journal-title":"Math. Program."},{"key":"778_CR20","doi-asserted-by":"crossref","unstructured":"Juditsky, A., Nemirovski, A.: First order methods for nonsmooth large-scale convex minimization, i: general purpose methods; ii: utilizing problem\u2019s structure. In: Sra, S., Nowozin, S., Wright, S. (eds). Optimization for Machine Learning, pp. 121\u2013184. The MIT Press, Cambridge (2012)","DOI":"10.7551\/mitpress\/8996.003.0007"},{"issue":"1\u20132","key":"778_CR21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-010-0434-y","volume":"133","author":"G Lan","year":"2012","unstructured":"Lan, G.: An optimal method for stochastic composite optimization. Math. Program. 133(1\u20132), 365\u2013397 (2012)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"778_CR22","first-page":"111","volume":"69","author":"C Lemar\u00c3chal","year":"1995","unstructured":"Lemar\u00c3chal, C., Nemirovskii, A., Nesterov, Y.: New variants of bundle methods. Math. Program. 69(1\u20133), 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"778_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","volume":"128","author":"S Ma","year":"2011","unstructured":"Ma, S., Goldfarb, D., Chen, L.: Fixed point and bregman iterative methods for matrix rank minimization. Math. Program. 128, 321\u2013353 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"778_CR24","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/moor.1090.0427","volume":"35","author":"A Nemirovski","year":"2010","unstructured":"Nemirovski, A., Onn, S., Rothblum, U.G.: Accuracy certificates for computational problems with convex structure. Math. Oper. Res. 35(1), 52\u201378 (2010)","journal-title":"Math. Oper. Res."},{"key":"778_CR25","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"AS Nemirovski","year":"1983","unstructured":"Nemirovski, A.S., Yudin, D.B.: Problem Complexity and Method Efficiency in Optimization. Wiley-Interscience, New York (1983)"},{"key":"778_CR26","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2003","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Berlin (2003)"},{"issue":"1","key":"778_CR27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite functions. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"778_CR28","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1017\/S096249291300007X","volume":"22","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y., Nemirovski, A.: On first-order algorithms for l 1\/nuclear norm minimization. Acta Numer. 22, 509\u2013575 (2013)","journal-title":"Acta Numer."},{"key":"778_CR29","unstructured":"Pshenichnyj, B., Danilin, Y.: Numerical Methods in Extremal Problems. Mir, Moscow (1978)"},{"issue":"3","key":"778_CR30","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/070697835","volume":"52","author":"B Recht","year":"2010","unstructured":"Recht, B., Fazel, M., Parrilo, P.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52(3), 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"issue":"2","key":"778_CR31","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s12532-013-0053-8","volume":"5","author":"B Recht","year":"2013","unstructured":"Recht, B., R\u00e9, C.: Parallel stochastic gradient algorithms for large-scale matrix completion. Math. Program. Comput. 5(2), 201\u2013226 (2013)","journal-title":"Math. Program. Comput."},{"key":"778_CR32","doi-asserted-by":"crossref","unstructured":"Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60 (1992)","DOI":"10.1016\/0167-2789(92)90242-F"},{"key":"778_CR33","unstructured":"Shalev-Shwartz, S., Gonen, A., Shamir, O.: Large-scale convex minimization with a low-rank constraint. In: ICML (2011)"},{"key":"778_CR34","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2010","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2010)"},{"key":"778_CR35","doi-asserted-by":"crossref","unstructured":"Srebro, N., Shraibman, A.: Rank, trace-norm and max-norm. In: COLT (2005)","DOI":"10.1007\/11503415_37"},{"key":"778_CR36","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01581238","volume":"59","author":"JA Ventura","year":"1993","unstructured":"Ventura, J.A., Hearn, D.W.: Restricted simplicial decomposition for convex constrained problems. Math. Program. 59, 71\u201385 (1993)","journal-title":"Math. Program."},{"issue":"281","key":"778_CR37","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1090\/S0025-5718-2012-02598-1","volume":"82","author":"J Yang","year":"2013","unstructured":"Yang, J., Yuan, X.: Linearized augmented lagrangian and alternating direction methods for nuclear norm minimization. Math. Comput. 82(281), 301\u2013329 (2013)","journal-title":"Math. Comput."},{"key":"778_CR38","unstructured":"Zhang, X., Yu, Y., Schuurmans, D.: Accelerated training for matrix-norm regularization: a boosting approach. In: NIPS, pp. 2915\u20132923 (2012)"},{"key":"778_CR39","unstructured":"Zibulevski, M., Narkiss, G.: Sequential subspace optimization method for large-scale unconstrained problems. Technical Report CCIT No 559, Faculty of Electrical engineering, Technion (2005)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0778-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0778-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0778-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,12]],"date-time":"2023-07-12T06:32:21Z","timestamp":1689143541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0778-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,18]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["778"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0778-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,18]]}}}