{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T15:25:32Z","timestamp":1790695532554,"version":"4.1.0"},"reference-count":48,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100004377","name":"Hong Kong Polytechnic University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004377","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Ministry of Education - Singapore","doi-asserted-by":"publisher","award":["R-146-000-256-114"],"award-info":[{"award-number":["R-146-000-256-114"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>In applying the level-set method developed in [E. Van den Berg and M. P. Friedlander, SIAM J. Sci. Comput., 31 (2008), pp. 890--912] and [E. Van den Berg and M. P. Friedlander, SIAM J. Optim., 21 (2011), pp. 1201--1229] to solve the fused lasso problems, one needs to solve a sequence of regularized least squares subproblems. In order to make the level-set method practical, we develop a highly efficient inexact semismooth Newton based augmented Lagrangian method for solving these subproblems. The efficiency of our approach is based on several ingredients that constitute the main contributions of this paper. First, an explicit formula for constructing the generalized Jacobian of the proximal mapping of the fused lasso regularizer is derived. Second, the special structure of the generalized Jacobian is carefully extracted and analyzed for the efficient implementation of the semismooth Newton method. Finally, numerical results, including the comparison between our approach and several state-of-the-art solvers, on real data sets are presented to demonstrate the high efficiency and robustness of our proposed algorithm in solving challenging large-scale fused lasso problems.<\/jats:p>","DOI":"10.1137\/17m1136390","type":"journal-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T13:36:40Z","timestamp":1529501800000},"page":"1842-1866","source":"Crossref","is-referenced-by-count":48,"title":["On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems"],"prefix":"10.1137","volume":"28","author":[{"given":"Xudong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Defeng","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim-Chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"atypb1","unstructured":"A. Y. Aravkin, J. V. Burke, D. Drusvyatskiy, M. P. Friedlander, and S. Roy,\n                      Level-Set Methods for Convex Optimization\n                      , preprint,https:\/\/arxiv.org\/abs\/1602.01506, 2016."},{"key":"atypb2","unstructured":"A\u0301. Barbero and S. Sra,\n                      Modular Proximal Optimization for Multidimensional Total-Variation Regularization\n                      , preprint,https:\/\/arxiv.org\/abs\/1411.0589, 2014."},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"atypb4","unstructured":"M. S. Bazaraa, H. D. Sherali, and C. M. Shetty,\n                      Nonlinear Programming: Theory and Algorithms\n                      , Wiley and Sons, New York, 1993."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1007-5"},{"key":"atypb8","unstructured":"F. H. Clarke,\n                      Optimization and Nonsmooth Analysis\n                      , Wiley and Sons, New York, 1983."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2013.2278339"},{"key":"atypb10","doi-asserted-by":"crossref","unstructured":"Y. Cui, D. F. Sun, and K.C. Toh,\n                      On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming\n                      , Math. Program., to appear,https:\/\/doi.org\/10.1007\/s10107-018-1300-6, 2018.","DOI":"10.1007\/s10107-018-1300-6"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/996986501"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"F. Facchinei and J.S. Pang,\n                      Finite-Dimensional Variational Inequalities and Complementarity Problems\n                      , Springer, New York, 2003.","DOI":"10.1007\/b97543"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/130940785"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1214\/07-AOAS131"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"atypb16","first-page":"41","volume":"9","author":"Glowinski R.","year":"1975","journal-title":"Revue Franc\u0327aise Automat. Informat. Recherche Ope\u0301rationnelle. Se\u0301r. Rouge Anal. Nume\u0301r."},{"key":"atypb17","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , 4th ed., Johns Hopkins Stud. Math. Sci., Johns Hopkins University Press, Baltimore, MD, 2013."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022653001160"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681238"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1515\/9783112479926-011"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1137\/16M1097572"},{"key":"atypb22","unstructured":"X. D. Li, D. F. Sun, and K.C. Toh,\n                      On the Efficient Computation of a Generalized Jacobian of the Projector over the Birkhoff Polytope\n                      , preprint,https:\/\/arxiv.org\/abs\/1702.05934, 2017."},{"key":"atypb23","unstructured":"J. Liu, S. Ji, and J. Ye,\n                      SLEP: Sparse Learning with Efficient Projections\n                      , Arizona State University, Phoenix, AZ, 2009."},{"key":"atypb24","first-page":"323","author":"Liu J.","year":"2010","journal-title":"New York"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/0322019"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1137\/0315061"},{"key":"atypb27","first-page":"372","volume":"27","author":"Nesterov Y.","year":"1983","journal-title":"Soviet Math. Dokl."},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/443\/08555"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02193060"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.2.401"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050369"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2017.2752261"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581275"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/060658576"},{"key":"atypb35","unstructured":"R. T. Rockafellar,\n                      Convex Analysis\n                      , Princeton University Press, Princeton, NJ, 1970."},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1.2.97"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"atypb38","unstructured":"R. T. Rockafellar and R. J.B. Wets,\n                      Variational Analysis\n                      , Springer, New York, 2009."},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940933"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.27.1.150.342"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1060.0195"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00490.x"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1137\/080714488"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1137\/100785028"},{"key":"atypb45","unstructured":"Y. Yu,\n                      On decomposing the proximal map\n                      , in Advances in Neural Information Processing Systems, NIPS, La Jolla, CA, 2013, pp. 91-99."},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-010-9408-8"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1137\/080718206"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2005.00503.x"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1136390","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:04:04Z","timestamp":1787339044000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1136390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1136390"],"URL":"https:\/\/doi.org\/10.1137\/17m1136390","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}