{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:41Z","timestamp":1740145181071,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:00:00Z","timestamp":1585008000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s11590-020-01565-4","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T17:03:25Z","timestamp":1585069405000},"page":"2443-2459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Minimizing a sum of clipped convex functions"],"prefix":"10.1007","volume":"14","author":[{"given":"Shane","family":"Barratt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillermo","family":"Angeris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,24]]},"reference":[{"key":"1565_CR1","unstructured":"Agrawal, A., Amos, B., Barratt, S., Boyd, S., Diamond, S., Kolter, J.Z.: Differentiable convex optimization layers. In: Advances in Neural Information Processing Systems, pp. 9558\u20139570 (2019)"},{"key":"1565_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"1565_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"issue":"1","key":"1565_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay, D., Mercier, B.: A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput. Math. Appl. 2(1), 17\u201340 (1976)","journal-title":"Comput. Math. Appl."},{"issue":"R2","key":"1565_CR5","first-page":"41","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski, R., Marroco, A.: Sur l\u2019approximation, par \u00e9l\u00e9ments finis d\u2019ordre un, et la r\u00e9solution, par p\u00e9nalisation-dualit\u00e9 d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9aires. ESAIM: Math. Model. Numer. Anal. 9(R2), 41\u201376 (1975)","journal-title":"ESAIM: Math. Model. Numer. Anal."},{"key":"1565_CR6","doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for non smooth convex programs. In: Recent Advances in Learning and Control, pp. 95\u2013110. Springer, London (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"issue":"1\u20132","key":"1565_CR7","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1\u20132), 183\u2013205 (2010)","journal-title":"Math. Program."},{"key":"1565_CR8","doi-asserted-by":"crossref","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulation and applications. In: Mixed Integer Nonlinear Programming, pp. 61\u201389. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-1927-3_3"},{"issue":"5","key":"1565_CR9","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1214\/aos\/1176342503","volume":"1","author":"P Huber","year":"1973","unstructured":"Huber, P.: Robust regression: asymptotics, conjectures and monte carlo. Ann. Stat. 1(5), 799\u2013821 (1973)","journal-title":"Ann. Stat."},{"key":"1565_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9780470434697","volume-title":"Robust Statistics","author":"P Huber","year":"2009","unstructured":"Huber, P., Ronchetti, E.: Robust Statistics. Wiley, London (2009)"},{"key":"1565_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Complexity of Computer Computations. Springer, Boston (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"1565_CR12","doi-asserted-by":"crossref","unstructured":"Lan, G., Hou, C., Yi, D.: Robust feature selection via simultaneous capped $$\\ell $$2-norm and $$\\ell $$2, 1-norm minimization. In: IEEE International Conference on Big Data Analysis, pp. 1\u20135 (2016)","DOI":"10.1109\/ICBDA.2016.7509813"},{"issue":"2","key":"1565_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s11081-015-9294-x","volume":"17","author":"T Lipp","year":"2016","unstructured":"Lipp, T., Boyd, S.: Variations and extension of the convex-concave procedure. Optim. Eng. 17(2), 263\u2013287 (2016)","journal-title":"Optim. Eng."},{"issue":"1\u20133","key":"1565_CR14","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/BF01589116","volume":"45","author":"D Liu","year":"1989","unstructured":"Liu, D., Nocedal, J.: On the limited memory BFGS method for large scale optimization. Math. Program. 45(1\u20133), 503\u2013528 (1989)","journal-title":"Math. Program."},{"issue":"1","key":"1565_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10618600.2017.1390471","volume":"28","author":"T Liu","year":"2019","unstructured":"Liu, T., Jiang, H.: Minimizing sum of truncated convex functions and its applications. J. Comput. Graph. Stat. 28(1), 1\u201310 (2019)","journal-title":"J. Comput. Graph. Stat."},{"key":"1565_CR16","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.sysconle.2015.09.002","volume":"86","author":"N Moehle","year":"2015","unstructured":"Moehle, N., Boyd, S.: A perspective-based convex relaxation for switched-affine optimal control. Syst. Control Lett. 86, 34\u201340 (2015)","journal-title":"Syst. Control Lett."},{"issue":"4","key":"1565_CR17","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"C Ong","year":"2013","unstructured":"Ong, C., An, L.: Learning sparse classifiers with difference of convex functions algorithms. Optim. Methods Softw. 28(4), 830\u2013854 (2013)","journal-title":"Optim. Methods Softw."},{"issue":"12","key":"1565_CR18","doi-asserted-by":"crossref","first-page":"5046","DOI":"10.1109\/TIP.2015.2478405","volume":"24","author":"J Portilla","year":"2015","unstructured":"Portilla, J., Tristan-Vega, A., Selesnick, I.: Efficient and robust image restoration using multiple-feature $$\\ell $$2-relaxed sparse analysis priors. IEEE Trans. Image Process. 24(12), 5046\u20135059 (2015)","journal-title":"IEEE Trans. Image Process."},{"key":"1565_CR19","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Anal.","author":"T Rockafellar","year":"1970","unstructured":"Rockafellar, T.: Convex Anal. Princeton University Press, Princeton (1970)"},{"issue":"6","key":"1565_CR20","doi-asserted-by":"publisher","first-page":"1447","DOI":"10.1007\/s00180-014-0500-7","volume":"29","author":"A Safari","year":"2014","unstructured":"Safari, A.: An e-E-insensitive support vector regression machine. Comput. Stat. 29(6), 1447\u20131468 (2014)","journal-title":"Comput. Stat."},{"issue":"494","key":"1565_CR21","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1198\/jasa.2011.tm10390","volume":"106","author":"Y She","year":"2011","unstructured":"She, Y., Owen, A.: Outlier detection using nonconvex penalized regression. J. Am. Stat. Assoc. 106(494), 626\u2013639 (2011)","journal-title":"J. Am. Stat. Assoc."},{"key":"1565_CR22","doi-asserted-by":"crossref","unstructured":"Sun, Q., Xiang, S., Ye, J.: Robust principal component analysis via capped norms. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 311\u2013319. (2013)","DOI":"10.1145\/2487575.2487604"},{"key":"1565_CR23","unstructured":"Suzumura, S., Ogawa, K., Sugiyama, M., Takeuchi, I.: Outlier path: A homotopy algorithm for robust SVM. In: International Conference on Machine Learning, pp. 1098\u20131106 (2014)"},{"issue":"1","key":"1565_CR24","first-page":"289","volume":"22","author":"P Tao","year":"1997","unstructured":"Tao, P., An, L.: Convex analysis approach to DC programming: Theory, algorithms and applications. Acta Math. Vietnam. 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam."},{"key":"1565_CR25","unstructured":"Torr, P., Zisserman, A.: Robust computation and parametrization of multiple view relations. In: Sixth International Conference on Computer Vision , pp. 727\u2013732 (1998)"},{"issue":"3","key":"1565_CR26","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1109\/TNNLS.2016.2637351","volume":"29","author":"G Xu","year":"2016","unstructured":"Xu, G., Hu, B.G., Principe, J.: Robust C-loss kernel classifiers. IEEE Trans. Neural Netw. Learn. Syst. 29(3), 510\u2013522 (2016)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"1565_CR27","unstructured":"Yu, Y.l., Yang, M., Xu, L., White, M., Schuurmans, D.: Relaxed clipping: A global training method for robust regression and classification. In: Advances in Neural Information Processing Systems, pp. 2532\u20132540 (2010)"},{"issue":"4","key":"1565_CR28","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A Yuille","year":"2003","unstructured":"Yuille, A., Rangarajan, A.: The concave-convex procedure. Neural Comput. 15(4), 915\u2013936 (2003)","journal-title":"Neural Comput."},{"key":"1565_CR29","unstructured":"Zhang, T.: Multi-stage convex relaxation for learning with sparse regularization. In: Advances in Neural Information Processing Systems, pp. 1929\u20131936 (2009)"},{"issue":"Mar","key":"1565_CR30","first-page":"1081","volume":"11","author":"T Zhang","year":"2010","unstructured":"Zhang, T.: Analysis of multi-stage convex relaxation for sparse regularization. J. Mach. Learn. Res. 11(Mar), 1081\u20131107 (2010)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01565-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01565-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01565-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T01:08:51Z","timestamp":1616548131000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01565-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,24]]},"references-count":30,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1565"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01565-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,3,24]]},"assertion":[{"value":"28 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}