{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:08:24Z","timestamp":1781215704623,"version":"3.54.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T00:00:00Z","timestamp":1440806400000},"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":[[2016,7]]},"DOI":"10.1007\/s10107-015-0943-9","type":"journal-article","created":{"date-parts":[[2015,8,28]],"date-time":"2015-08-28T15:56:11Z","timestamp":1440777371000},"page":"501-546","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":91,"title":["A proximal method for composite minimization"],"prefix":"10.1007","volume":"158","author":[{"given":"A. S.","family":"Lewis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. J.","family":"Wright","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,8,29]]},"reference":[{"key":"943_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1287\/moor.1110.0481","volume":"36","author":"J Bolte","year":"2011","unstructured":"Bolte, J., Daniilidis, A., Lewis, A.S.: Generic optimality conditions for semialgebraic convex problems. Math. Oper. Res. 36, 55\u201370 (2011)","journal-title":"Math. Oper. Res."},{"key":"943_CR2","series-title":"Springer Series in Operations Research","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1394-9","volume-title":"Perturbation Analysis of Optimization Problems","author":"JF Bonnans","year":"2000","unstructured":"Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer Series in Operations Research. Springer, Berlin (2000)"},{"key":"943_CR3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"JV Burke","year":"1985","unstructured":"Burke, J.V.: Descent methods for composite nondifferentiable optimization problems. Math. Program. Ser. A 33, 260\u2013279 (1985)","journal-title":"Math. Program. Ser. A"},{"key":"943_CR4","doi-asserted-by":"crossref","first-page":"1081","DOI":"10.1137\/0727064","volume":"27","author":"JV Burke","year":"1990","unstructured":"Burke, J.V.: On the identification of active constraints II: the nonconvex case. SIAM J. Numer. Anal. 27, 1081\u20131102 (1990)","journal-title":"SIAM J. Numer. Anal."},{"key":"943_CR5","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1137\/0725068","volume":"25","author":"JV Burke","year":"1988","unstructured":"Burke, J.V., Mor\u00e9, J.J.: On the identification of active constraints. SIAM J. Numer. Anal. 25, 1197\u20131211 (1988)","journal-title":"SIAM J. Numer. Anal."},{"key":"943_CR6","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S1052623403426532","volume":"16","author":"R Byrd","year":"2005","unstructured":"Byrd, R., Gould, N.I.M., Nocedal, J., Waltz, R.A.: On the convergence of successive linear-quadratic programming algorithms. SIAM J. Optim. 16, 471\u2013489 (2005)","journal-title":"SIAM J. Optim."},{"key":"943_CR7","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1137\/080738970","volume":"20","author":"J-F Cai","year":"2010","unstructured":"Cai, J.-F., Cand\u00e8s, E., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956\u20131982 (2010)","journal-title":"SIAM J. Optim."},{"key":"943_CR8","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, 717\u2013772 (2009)","journal-title":"Found. Comput. Math."},{"key":"943_CR9","unstructured":"Cand\u00e8s, E.J.: Compressive sampling. In: Proceedings of the International Congress of Mathematicians, Madrid (2006)"},{"key":"943_CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"SS Chen","year":"1998","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20, 33\u201361 (1998)","journal-title":"SIAM J. Sci. Comput."},{"key":"943_CR11","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1137\/S0363012903427336","volume":"43","author":"P Combettes","year":"2004","unstructured":"Combettes, P., Pennanen, T.: Proximal methods for cohypomonotone operators. SIAM J. Control Optim. 43, 731\u2013742 (2004)","journal-title":"SIAM J. Control Optim."},{"key":"943_CR12","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"key":"943_CR13","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1080\/02331930600815884","volume":"55","author":"A Daniilidis","year":"2006","unstructured":"Daniilidis, A., Hare, W., Malick, J.: Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems. Optimization 55, 481\u2013503 (2006)","journal-title":"Optimization"},{"key":"943_CR14","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1016\/j.jmaa.2007.12.057","volume":"342","author":"AV Dmitruk","year":"2008","unstructured":"Dmitruk, A.V., Kruger, A.Y.: Metric regularity and systems of generalized equations. J. Math. Anal. Appl. 342, 864\u2013873 (2008)","journal-title":"J. Math. Anal. Appl."},{"key":"943_CR15","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1090\/S0002-9947-02-03088-X","volume":"355","author":"AL Dontchev","year":"2003","unstructured":"Dontchev, A.L., Lewis, A.S., Rockafellar, R.T.: The radius of metric regularity. Trans. Am. Math. Soc. 355, 493\u2013517 (2003)","journal-title":"Trans. Am. Math. Soc."},{"key":"943_CR16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R.: Least angle regression. Ann. Stat. 32, 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"key":"943_CR17","doi-asserted-by":"crossref","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconvex penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96, 1348\u20131361 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"943_CR18","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01582292","volume":"43","author":"R Fletcher","year":"1989","unstructured":"Fletcher, R., Sainz de la Maza, E.: Nonlinear programming and nonsmooth optimization by successive linear programming. Math. Program. 43, 235\u2013256 (1989)","journal-title":"Math. Program."},{"key":"943_CR19","unstructured":"Friedlander, M.P., Gould, N.I.M., Leyffer, S., Munson, T.S.: A filter active-set trust-region method, Preprint ANL\/MCS-P1456-0907, Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S. Cass Avenue, Argonne IL 60439, September 2007"},{"key":"943_CR20","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M Fukushima","year":"1981","unstructured":"Fukushima, M., Mine, H.: A generalized proximal point algorithm for certain nonconvex minimization problems. Int. J. Syst. Sci. 12, 989\u20131000 (1981)","journal-title":"Int. J. Syst. Sci."},{"key":"943_CR21","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1137\/070698920","volume":"19","author":"ET Hale","year":"2008","unstructured":"Hale, E.T., Yin, W., Zhang, Y.: A fixed-point continuation method for $$\\ell _1$$ \u2113 1 -minimization: methodology and convergence. SIAM J. Optim. 19, 1107\u20131130 (2008)","journal-title":"SIAM J. Optim."},{"key":"943_CR22","first-page":"251","volume":"11","author":"W Hare","year":"2004","unstructured":"Hare, W., Lewis, A.: Identifying active constraints via partial smoothness and prox-regularity. J. Convex Anal. 11, 251\u2013266 (2004)","journal-title":"J. Convex Anal."},{"key":"943_CR23","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1137\/S1052623401399587","volume":"13","author":"A Iusem","year":"2003","unstructured":"Iusem, A., Pennanen, T., Svaiter, B.: Inexact variants of the proximal point algorithm without monotonicity. SIAM J. Optim. 13, 1080\u20131097 (2003)","journal-title":"SIAM J. Optim."},{"key":"943_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1137\/070686676","volume":"31","author":"S Jokar","year":"2008","unstructured":"Jokar, S., Pfetsch, M.E.: Exact and approximate sparse solutions of underdetermined linear equations. SIAM J. Sci. Comput. 31, 23\u201344 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"943_CR25","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1023\/A:1008321423879","volume":"13","author":"A Kaplan","year":"1998","unstructured":"Kaplan, A., Tichatschke, R.: Proximal point methods and nonconvex optimization. J. Glob. Optim. 13, 389\u2013406 (1998)","journal-title":"J. Glob. Optim."},{"key":"943_CR26","doi-asserted-by":"crossref","unstructured":"Kim, T., Wright, S.J.: An $$\\text{ S }\\ell _1\\text{ LP }$$ S \u2113 1 LP -active set approach for feasibility restoration in power systems, tech. rep., Computer Science Department, University of Wisconsin-Madison, May 2014. arXiv:1405.0322","DOI":"10.1007\/s11081-015-9292-z"},{"key":"943_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-013-0737-x","volume":"149","author":"G Lan","year":"2015","unstructured":"Lan, G.: Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization. Math. Program. Ser. A 149, 1\u201345 (2015)","journal-title":"Math. Program. Ser. A"},{"key":"943_CR28","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9947-99-02243-6","volume":"352","author":"C Lemar\u00e9chal","year":"2000","unstructured":"Lemar\u00e9chal, C., Oustry, F., Sagastiz\u00e1bal, C.: The $${\\cal {U}}$$ U -Lagrangian of a convex function. Trans. Am. Math. Soc. 352, 711\u2013729 (2000)","journal-title":"Trans. Am. Math. Soc."},{"key":"943_CR29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/moor.26.1.105.10600","volume":"26","author":"A Levy","year":"2001","unstructured":"Levy, A.: Lipschitzian multifunctions and a Lipschitzian inverse mapping theorem. Math. Oper. Res. 26, 105\u2013118 (2001)","journal-title":"Math. Oper. Res."},{"key":"943_CR30","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S1052623401387623","volume":"13","author":"A Lewis","year":"2003","unstructured":"Lewis, A.: Active sets, nonsmoothness, and sensitivity. SIAM J. Optim. 13, 702\u2013725 (2003)","journal-title":"SIAM J. Optim."},{"key":"943_CR31","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1080\/02331939908844431","volume":"45","author":"OL Mangasarian","year":"1999","unstructured":"Mangasarian, O.L.: Minimum-support solutions of polyhedral concave programs. Optimization 45, 149\u2013162 (1999)","journal-title":"Optimization"},{"key":"943_CR32","first-page":"154","volume":"4","author":"B Martinet","year":"1970","unstructured":"Martinet, B.: R\u00e9gularisation d\u2019in\u00e9quations variationnelles par approximations successives. Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle 4, 154\u2013158 (1970)","journal-title":"Rev. Fran\u00e7aise Informat. Recherche Op\u00e9rationnelle"},{"key":"943_CR33","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10107-005-0630-3","volume":"104","author":"R Mifflin","year":"2005","unstructured":"Mifflin, R., Sagastiz\u00e1bal, C.: A VU-algorithm for convex minimization. Math. Program. Ser. B 104, 583\u2013608 (2005)","journal-title":"Math. Program. Ser. B"},{"key":"943_CR34","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10107-005-0631-2","volume":"104","author":"SA Miller","year":"2005","unstructured":"Miller, S.A., Malick, J.: Newton methods for nonsmooth convex minimization: connections among $${\\cal {U}}$$ U -Lagrangian, Reimannian Newton, and SQP methods. Math. Program. Ser. B 104, 609\u2013633 (2005)","journal-title":"Math. Program. Ser. B"},{"key":"943_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-31247-1","volume-title":"Variational Analysis and Generalized Differentiation, I: Basic Theory; II: Applications","author":"B Mordukhovich","year":"2006","unstructured":"Mordukhovich, B.: Variational Analysis and Generalized Differentiation, I: Basic Theory; II: Applications. Springer, New York (2006)"},{"key":"943_CR36","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.27.1.170.331","volume":"27","author":"T Pennanen","year":"2002","unstructured":"Pennanen, T.: Local convergence of the proximal point algorithm and multiplier methods without monotonicity. Math. Oper. Res. 27, 170\u2013191 (2002)","journal-title":"Math. Oper. Res."},{"key":"943_CR37","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 matrix equations via nuclear norm minimization. SIAM Rev. 52, 471\u2013501 (2010)","journal-title":"SIAM Rev."},{"key":"943_CR38","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"943_CR39","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"943_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.: Variational Analysis. Springer, Berlin (1998)"},{"key":"943_CR41","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0167-2789(92)90242-F","volume":"60","author":"L Rudin","year":"1992","unstructured":"Rudin, L., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60, 259\u2013268 (1992)","journal-title":"Phys. D"},{"key":"943_CR42","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s10107-012-0600-5","volume":"140","author":"C Sagastiz\u00e1bal","year":"2013","unstructured":"Sagastiz\u00e1bal, C.: Composite proximal bundle method. Math. Program. Ser. B 140, 189\u2013233 (2013)","journal-title":"Math. Program. Ser. B"},{"key":"943_CR43","first-page":"563","volume":"9","author":"C Sagastiz\u00e1bal","year":"2002","unstructured":"Sagastiz\u00e1bal, C., Mifflin, R.: Proximal points are on the fast track. J. Convex Anal. 9, 563\u2013579 (2002)","journal-title":"J. Convex Anal."},{"key":"943_CR44","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1287\/moor.28.4.677.20512","volume":"28","author":"A Shapiro","year":"2003","unstructured":"Shapiro, A.: On a class of nonsmooth composite functions. Math. Oper. Res. 28, 677\u2013692 (2003)","journal-title":"Math. Oper. Res."},{"key":"943_CR45","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4310\/SII.2008.v1.n1.a12","volume":"1","author":"W Shi","year":"2008","unstructured":"Shi, W., Wahba, G., Wright, S.J., Lee, K., Klein, R., Klein, B.: LASSO-Patternsearch algorithm with application to opthalmology data. Stat. Interface 1, 137\u2013153 (2008)","journal-title":"Stat. Interface"},{"key":"943_CR46","doi-asserted-by":"crossref","unstructured":"Spingarn, J.: Submonotone mappings and the proximal point algorithm. Numer. Funct. Anal. Optim. 4, 123\u2013150 (1981\/82)","DOI":"10.1080\/01630568208816109"},{"key":"943_CR47","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the LASSO. J. R. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. B"},{"key":"943_CR48","doi-asserted-by":"crossref","first-page":"1832","DOI":"10.1137\/090747695","volume":"32","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Yin, W., Zhang, H., Goldfarb, D.: On the convergence of an active set method for $$\\ell _1$$ \u2113 1 minimization. SIAM J. Sci. Comput. 32, 1832\u20131857 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"943_CR49","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/imanum\/10.3.299","volume":"9","author":"SJ Wright","year":"1990","unstructured":"Wright, S.J.: Convergence of an inexact algorithm for composite nonsmooth optimization. IMA J. Numer. Anal. 9, 299\u2013321 (1990)","journal-title":"IMA J. Numer. Anal."},{"key":"943_CR50","doi-asserted-by":"crossref","first-page":"1063","DOI":"10.1137\/0331048","volume":"31","author":"SJ Wright","year":"1993","unstructured":"Wright, S.J.: Identifiable surfaces in constrained optimization. SIAM J. Control Optim. 31, 1063\u20131079 (1993)","journal-title":"SIAM J. Control Optim."},{"key":"943_CR51","doi-asserted-by":"crossref","first-page":"2479","DOI":"10.1109\/TSP.2009.2016892","volume":"57","author":"SJ Wright","year":"2009","unstructured":"Wright, S.J., Nowak, R.D., Figueiredo, M.A.T.: Sparse reconstruction by separable approximation. IEEE Trans. Signal Process. 57, 2479\u20132493 (2009)","journal-title":"IEEE Trans. Signal Process."},{"key":"943_CR52","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02591750","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: Conditions for convergence of a trust-region method for nonsmooth optimization. Math. Program. 31, 220\u2013228 (1985)","journal-title":"Math. Program."},{"key":"943_CR53","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02591949","volume":"31","author":"Y Yuan","year":"1985","unstructured":"Yuan, Y.: On the superlinear convergence of a trust region algorithm for nonsmooth optimization. Math. Program. 31, 269\u2013285 (1985)","journal-title":"Math. Program."},{"key":"943_CR54","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1214\/09-AOS729","volume":"38","author":"CH Zhang","year":"2010","unstructured":"Zhang, C.H.: Nearly unbiased variable selection under minimax concave penalty. Ann. Stat. 38, 894\u2013942 (2010)","journal-title":"Ann. Stat."},{"key":"943_CR55","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-S\u00e1nchez, C.E., Thomas, R.J.: MATPOWER: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26, 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0943-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0943-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0943-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T20:12:54Z","timestamp":1718050374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0943-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,29]]},"references-count":55,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["943"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0943-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,29]]}}}