{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:03:22Z","timestamp":1781280202011,"version":"3.54.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T00:00:00Z","timestamp":1185926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10107-007-0170-0","type":"journal-article","created":{"date-parts":[[2007,7,31]],"date-time":"2007-07-31T14:09:50Z","timestamp":1185890990000},"page":"387-423","source":"Crossref","is-referenced-by-count":485,"title":["A coordinate gradient descent method for nonsmooth separable minimization"],"prefix":"10.1007","volume":"117","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2007,8,1]]},"reference":[{"key":"170_CR1","first-page":"429","volume-title":"Nonlinear Programming, vol 3.","author":"A. Auslender","year":"1978","unstructured":"Auslender A. (1978). Minimisation de fonctions localement lipschitziennes: applications \u00e0 la programmation mi-convexe, mi-diff\u00e9rentiable. In: Mangasarian, O.L., Meyer, R.R. and Robinson, S.M. (eds) Nonlinear Programming, vol 3., pp 429\u2013460. Academic, New York"},{"key":"170_CR2","unstructured":"Balakrishnan, S.: Private communication (2006)"},{"key":"170_CR3","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"D.P. Bertsekas","year":"1982","unstructured":"Bertsekas D.P. (1982). Constrained Optimization and Lagrange Multiplier Methods. Academic, New York"},{"key":"170_CR4","volume-title":"Nonlinear Programming, 2nd edn","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas D.P. (1999). Nonlinear Programming, 2nd edn. Athena Scientific, Belmont"},{"key":"170_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1287\/ijoc.11.3.217","volume":"11","author":"P.S. Bradley","year":"1999","unstructured":"Bradley P.S., Fayyad U.M. and Mangasarian O.L. (1999). Mathematical programming for data mining: formulations and challenges. INFORMS J. Comput. 11: 217\u2013238","journal-title":"INFORMS J. Comput."},{"key":"170_CR6","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/BF01584377","volume":"33","author":"J.V. Burke","year":"1985","unstructured":"Burke J.V. (1985). Descent methods for composite nondifferentiable optimization problems. Math. Program. 33: 260\u2013279","journal-title":"Math. Program."},{"key":"170_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S. Chen","year":"1999","unstructured":"Chen S., Donoho D. and Saunders M. (1999). Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20: 33\u201361","journal-title":"SIAM J. Sci. Comput."},{"key":"170_CR8","volume-title":"Parallel Optimization: Theory, Algorithms, and Applications","author":"Y. Censor","year":"1997","unstructured":"Censor Y. and Zenios S.A. (1997). Parallel Optimization: Theory, Algorithms and Applications. Oxford University Press, New York"},{"key":"170_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-Region Methods","author":"A.R. Conn","year":"2000","unstructured":"Conn A.R., Gould N.I.M. and Toint Ph.L. (2000). Trust-Region Methods. SIAM, Philadelphia"},{"key":"170_CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1093\/biomet\/81.3.425","volume":"81","author":"D.L. Donoho","year":"1994","unstructured":"Donoho D.L. and Johnstone I.M. (1994). Ideal spatial adaptation by wavelet shrinkage. Biometrika 81: 425\u2013455","journal-title":"Biometrika"},{"key":"170_CR11","doi-asserted-by":"crossref","first-page":"1200","DOI":"10.1080\/01621459.1995.10476626","volume":"90","author":"D.L. Donoho","year":"1995","unstructured":"Donoho D.L. and Johnstone I.M. (1995). Adapting to unknown smoothness via wavelet shrinkage. J. Am. Stat. Assoc. 90: 1200\u20131224","journal-title":"J. Am. Stat. Assoc."},{"key":"170_CR12","unstructured":"Drucker, H., Burges, C.J.C., Kaufman, L., Smola, A., Vapnik, V.: Support vector regression machines. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems 9. MIT Press, Cambridge (1997)"},{"key":"170_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/S1052623496305882","volume":"9","author":"F. Facchinei","year":"1998","unstructured":"Facchinei F., Fischer A. and Kanzow C. (1998). On the accurate identification of active constraints. SIAM J. Optim. 9: 14\u201332","journal-title":"SIAM J. Optim."},{"key":"170_CR14","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems, Vols. I and II","author":"F. Facchinei","year":"2003","unstructured":"Facchinei F. and Pang J.-S. (2003). Finite-Dimensional Variational Inequalities and Complementarity Problems, Vols. I and II. Springer, New York"},{"key":"170_CR15","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1137\/0804047","volume":"4","author":"M.C. Ferris","year":"1994","unstructured":"Ferris M.C. and Mangasarian O.L. (1994). Parallel variable distribution. SIAM J. Optim. 4: 815\u2013832","journal-title":"SIAM J. Optim."},{"key":"170_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0120959","volume":"17","author":"R. Fletcher","year":"1982","unstructured":"Fletcher R. (1982). A model algorithm for composite nondifferentiable optimization problems. Math. Program. Study 17: 67\u201376","journal-title":"Math. Program. Study"},{"key":"170_CR17","volume-title":"Practical Methods of Optimization, 2nd edn","author":"R. Fletcher","year":"1987","unstructured":"Fletcher R. (1987). Practical Methods of Optimization, 2nd edn. Wiley, Chichester"},{"key":"170_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-94-009-0369-2_5","volume-title":"Algorithms for Continuous Optimization.","author":"R. Fletcher","year":"1994","unstructured":"Fletcher R. (1994). An overview of unconstrained optimization. In: Spedicato, E. (eds) Algorithms for Continuous Optimization., pp 109\u2013143. Kluwer, Dordrecht"},{"key":"170_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01588789","volume":"49","author":"M. Fukushima","year":"1990","unstructured":"Fukushima M. (1990). A successive quadratic programming method for a class of constrained nonsmooth optimization problems. Math. Program. 49: 231\u2013251","journal-title":"Math. Program."},{"key":"170_CR20","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/S1052623496309879","volume":"8","author":"M. Fukushima","year":"1998","unstructured":"Fukushima M. (1998). Parallel variable transformation in unconstrained optimization. SIAM J. Optim. 8: 658\u2013672","journal-title":"SIAM J. Optim."},{"key":"170_CR21","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1080\/00207728108963798","volume":"12","author":"M. Fukushima","year":"1981","unstructured":"Fukushima M. and Mine H. (1981). A generalized proximal point algorithm for certain non-convex minimization problems. Int. J. Syst. Sci. 12: 989\u20131000","journal-title":"Int. J. Syst. Sci."},{"key":"170_CR22","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/962437.962439","volume":"29","author":"N.I.M. Gould","year":"2003","unstructured":"Gould N.I.M., Orban D. and Toint Ph.L. (2003). CUTEr, a constrained and unconstrained testing environment, revisited. ACM Trans. Math. Softw. 29: 373\u2013394","journal-title":"ACM Trans. Math. Softw."},{"key":"170_CR23","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L. Grippo","year":"2000","unstructured":"Grippo L. and Sciandrone M. (2000). On the convergence of the block nonlinear Gauss\u2013Seidel method under convex constraints. Oper. Res. Lett. 26: 127\u2013136","journal-title":"Oper. Res. Lett."},{"key":"170_CR24","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970920","volume-title":"Iterative Methods for Optimization","author":"C.T. Kelley","year":"1999","unstructured":"Kelley C.T. (1999). Iterative Methods for Optimization. SIAM, Philadelphia"},{"key":"170_CR25","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF00940570","volume":"48","author":"K.C. Kiwiel","year":"1986","unstructured":"Kiwiel K.C. (1986). A method for minimizing the sum of a convex function and a continuously differentiable function. J. Optim. Theory Appl. 48: 437\u2013449","journal-title":"J. Optim. Theory Appl."},{"key":"170_CR26","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"Z.-Q. Luo","year":"1992","unstructured":"Luo Z.-Q. and Tseng P. (1992). Error bounds and the convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2: 43\u201354","journal-title":"SIAM J. Optim."},{"key":"170_CR27","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z.-Q. Luo","year":"1992","unstructured":"Luo Z.-Q. and Tseng P. (1992). On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30: 408\u2013425","journal-title":"SIAM J. Control Optim."},{"key":"170_CR28","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/moor.18.4.846","volume":"18","author":"Z.-Q. Luo","year":"1993","unstructured":"Luo Z.-Q. and Tseng P. (1993). On the convergence rate of dual ascent methods for linearly constrained convex minimization. Math. Oper. Res. 18: 846\u2013867","journal-title":"Math. Oper. Res."},{"key":"170_CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","author":"Z.-Q. Luo","year":"1993","unstructured":"Luo Z.-Q. and Tseng P. (1993). Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46: 157\u2013178","journal-title":"Ann. Oper. Res."},{"key":"170_CR30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0305-0548(69)90004-5","volume":"11","author":"O.L. Mangasarian","year":"1984","unstructured":"Mangasarian O.L. (1984). Sparsity-preserving SOR algorithms for separable quadratic and linear programming. Comput. Oper. Res. 11: 105\u2013112","journal-title":"Comput. Oper. Res."},{"key":"170_CR31","doi-asserted-by":"crossref","first-page":"1916","DOI":"10.1137\/S0363012993250220","volume":"33","author":"O.L. Mangasarian","year":"1995","unstructured":"Mangasarian O.L. (1995). Parallel gradient distribution in unconstrained optimization. SIAM J. Control Optim. 33: 1916\u20131925","journal-title":"SIAM J. Control Optim."},{"key":"170_CR32","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02186473","volume":"14","author":"O.L. Mangasarian","year":"1988","unstructured":"Mangasarian O.L. and De Leone R. (1988). Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs. Ann. Oper. Res. 14: 41\u201359","journal-title":"Ann. Oper. Res."},{"key":"170_CR33","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1109\/72.788643","volume":"10","author":"O.L. Mangasarian","year":"1999","unstructured":"Mangasarian O.L. and Musicant D.R. (1999). Successive overrelaxation for support vector machines. IEEE Trans. Neural Netw. 10: 1032\u20131037","journal-title":"IEEE Trans. Neural Netw."},{"key":"170_CR34","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1012422931930","volume":"46","author":"O.L. Mangasarian","year":"2002","unstructured":"Mangasarian O.L. and Musicant D.R. (2002). Large scale kernel regression via linear programming. Mach. Learn. 46: 255\u2013269","journal-title":"Mach. Learn."},{"key":"170_CR35","unstructured":"Meier, L., van de Geer, S., B\u00fchlmann, P.: The group Lasso for logistic regression. Report Seminar f\u00fcr Statistik, ETH Z\u00fcrich, Z\u00fcrich"},{"key":"170_CR36","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF00935173","volume":"33","author":"H. Mine","year":"1981","unstructured":"Mine H. and Fukushima M. (1981). A minimization method for the sum of a convex function and a continuously differentiable function. J. Optim. Theory Appl. 33: 9\u201323","journal-title":"J. Optim. Theory Appl."},{"key":"170_CR37","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"J.J. Mor\u00e9","year":"1981","unstructured":"Mor\u00e9 J.J., Garbow B.S. and Hillstrom K.E. (1981). Testing unconstrained optimization software. ACM Trans. Math. Softw. 7: 17\u201341","journal-title":"ACM Trans. Math. Softw."},{"key":"170_CR38","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1137\/0801008","volume":"1","author":"J.J. Mor\u00e9","year":"1991","unstructured":"Mor\u00e9 J.J. and Toraldo G. (1991). On the solution of large quadratic programming problems with bound constraints. SIAM J. Optim. 1: 93\u2013113","journal-title":"SIAM J. Optim."},{"key":"170_CR39","unstructured":"Murtagh, B.A., Saunders, M.A.: MINOS 5.5 user\u2019s guide. Report SOL 83-20R. Department of Operations Research, Stanford University, Stanford (1998)"},{"key":"170_CR40","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J. Nocedal","year":"1980","unstructured":"Nocedal J. (1980). Updating quasi-Newton matrices with limited storage. Math. Comp. 35: 773\u2013782","journal-title":"Math. Comp."},{"key":"170_CR41","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J. and Wright S.J. (1999). Numerical Optimization. Springer, New York"},{"key":"170_CR42","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719468","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"J.M. Ortega","year":"2000","unstructured":"Ortega J.M. and Rheinboldt W.C. (2000). Iterative Solution of Nonlinear Equations in Several Variables. Reprinted by SIAM, Philadelphia"},{"key":"170_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01584660","volume":"4","author":"M.J.D. Powell","year":"1973","unstructured":"Powell M.J.D. (1973). On search directions for minimization algorithms. Math. Program. 4: 193\u2013201","journal-title":"Math. Program."},{"key":"170_CR44","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BFb0120929","volume":"14","author":"S.M. Robinson","year":"1981","unstructured":"Robinson S.M. (1981). Some continuity properties of polyhedral multifunctions. Math. Program. Study 14: 206\u2013214","journal-title":"Math. Program. Study"},{"key":"170_CR45","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s101070050078","volume":"86","author":"S.M. Robinson","year":"1999","unstructured":"Robinson S.M. (1999). Linear convergence of \u03b5-subgradient descent methods for a class of convex functions. Math. Program. 86: 41\u201350","journal-title":"Math. Program."},{"key":"170_CR46","unstructured":"Robinson, S.M.: Calmness and Lipschitz continuity for multifunctions. Report, Department of Industrial Engineering, University of Wisconsin, Madison (2006)"},{"key":"170_CR47","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar R.T. (1970). Convex Analysis. Princeton University Press, Princeton"},{"key":"170_CR48","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar R.T. and Wets R.J.-B. (1998). Variational Analysis. Springer, New York"},{"key":"170_CR49","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/10618600.2000.10474885","volume":"9","author":"S. Sardy","year":"2000","unstructured":"Sardy S., Bruce A. and Tseng P. (2000). Block coordinate relaxation methods for nonparametric wavelet denoising. J. Comput. Graph. Stat. 9: 361\u2013379","journal-title":"J. Comput. Graph. Stat."},{"key":"170_CR50","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1109\/78.923297","volume":"49","author":"S. Sardy","year":"2001","unstructured":"Sardy S., Bruce A. and Tseng P. (2001). Robust wavelet denoising. IEEE Trans. Signal Proc. 49: 1146\u20131152","journal-title":"IEEE Trans. Signal Proc."},{"key":"170_CR51","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1198\/1061860043434","volume":"13","author":"S. Sardy","year":"2004","unstructured":"Sardy S. and Tseng P. (2004). AMlet, RAMlet and GAMlet: automatic nonlinear fitting of additive models, robust and generalized, with wavelets. J. Comput. Graph. Stat. 13: 283\u2013309","journal-title":"J. Comput. Graph. Stat."},{"key":"170_CR52","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1198\/016214504000000188","volume":"99","author":"S. Sardy","year":"2004","unstructured":"Sardy S. and Tseng P. (2004). On the statistical analysis of smoothing by maximizing dirty Markov random field posterior distributions. J. Am. Stat. Assoc. 99: 191\u2013204","journal-title":"J. Am. Stat. Assoc."},{"key":"170_CR53","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1137\/0801036","volume":"1","author":"P. Tseng","year":"1991","unstructured":"Tseng P. (1991). On the rate of convergence of a partially asynchronous gradient projection algorithm. SIAM J. Optim. 1: 603\u2013619","journal-title":"SIAM J. Optim."},{"key":"170_CR54","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01581245","volume":"59","author":"P. Tseng","year":"1993","unstructured":"Tseng P. (1993). Dual coordinate ascent methods for non-strictly convex minimization. Math. Program. 59: 231\u2013247","journal-title":"Math. Program."},{"key":"170_CR55","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P. Tseng","year":"2001","unstructured":"Tseng P. (2001). Convergence of block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109: 473\u2013492","journal-title":"J. Optim. Theory Appl."},{"key":"170_CR56","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for nonsmooth separable minimization. Report, Department of Mathematics, University of Washington, Seattle; June 2006; revised February 2007. http:\/\/www.math.washington.edu\/~tseng\/papers.html"},{"key":"170_CR57","unstructured":"Vapnik, V., Golowich, S.E., Smola, A.: Support vector method for function approximation, regression estimation, and signal processing. In: Mozer, M.C., Jordan, M.I., and Petsche, T., (eds.) Advances in Neural Information Processing Systems, vol. 9. MIT Press, Cambridge (1997)"},{"key":"170_CR58","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"L. Yuan","year":"2006","unstructured":"Yuan L. and Lin Y. (2006). Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. 68: 49\u201367","journal-title":"J. R. Stat. Soc."},{"key":"170_CR59","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C. Zhu","year":"1997","unstructured":"Zhu C., Byrd R.H. and Nocedal J. (1997). L-BFGS-B: Algorithm 778: L-BFGS-B, FORTRAN routines for large scale bound constrained optimization. ACM Trans. Math. Softw. 23: 550\u2013560","journal-title":"ACM Trans. Math. Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0170-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-007-0170-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-007-0170-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T01:12:58Z","timestamp":1737335578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-007-0170-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,1]]},"references-count":59,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["170"],"URL":"https:\/\/doi.org\/10.1007\/s10107-007-0170-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,1]]}}}