{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:37:39Z","timestamp":1787341059057,"version":"build-2736575974"},"reference-count":55,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>Motivated by block partitioned problems arising from group sparsity representation and generalized noncooperative potential games, this paper presents a basic decomposition method for a broad class of multiblock nonsmooth optimization problems subject to coupled linear constraints on the variables that may additionally be individually constrained. The objective of such an optimization problem is given by the sum of two nonseparable functions minus a sum of separable, pointwise maxima of finitely many convex differentiable functions. One of the former two nonseparable functions is of the class LC$^1$, i.e., differentiable with a Lipschitz gradient, while the other summand is multiconvex. The subtraction of the separable, pointwise maxima of convex functions induces a partial difference-of-convex (DC) structure in the overall objective; yet with all three terms together, the objective is nonsmooth and non-DC, but is blockwise directionally differentiable. By taking advantage of the (negative) pointwise maximum structure in the objective, the developed algorithm and its convergence result are aimed at the computation of a blockwise directional stationary solution, which arguably is the sharpest kind of stationary solutions for this class of nonsmooth problems. This aim is accomplished by combining the alternating direction method of multipliers (ADMM) with a semilinearized Gauss--Seidel scheme, resulting in a decomposition of the overall problem into subproblems each involving the individual blocks. To arrive at a stationary solution of the desired kind, our algorithm solves multiple convex subprograms at each iteration, one per convex function in each pointwise maximum. In order to lessen the potential computational burden in each iteration, a probabilistic version of the algorithm is presented and its almost sure convergence is established.<\/jats:p>","DOI":"10.1137\/17m1110249","type":"journal-article","created":{"date-parts":[[2018,5,15]],"date-time":"2018-05-15T16:14:57Z","timestamp":1526400897000},"page":"1640-1669","source":"Crossref","is-referenced-by-count":18,"title":["Decomposition Methods for Computing Directional Stationary Solutions of a Class of Nonsmooth Nonconvex Optimization Problems"],"prefix":"10.1137","volume":"28","author":[{"given":"Jong-Shi","family":"Pang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,5,15]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084754"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2315167"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-016-9828-y"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0449"},{"key":"atypb5","unstructured":"D. Bertsekas,\n                      Constrained Optimization and Lagrange Multiplier Methods\n                      , Academic Press, New York, 1982."},{"key":"atypb6","unstructured":"D.P. Bertsekas and J.N. Tsitsiklis,\n                      Neuro-Dynamic Programming\n                      , Athena Scientific, Belmont, MA, 1996."},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1016\/0041-5553(67)90040-7"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1137\/110860185"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.4208\/eajam.270812.161112a"},{"key":"atypb11","unstructured":"F.H. Clarke,\n                      Optimization and Nonsmooth Analysis\n                      , Classics Appl. Math. 5, SIAM, Philadelphia, PA, 1987."},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"R.W. Cottle, J.S. Pang, and R.S. Stone,\n                      The Linear Complementarity Problem\n                      , Classics Appl. Math. 60, SIAM, Philadelphia, PA, 2009.","DOI":"10.1137\/1.9780898719000"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0877-2"},{"key":"atypb14","unstructured":"J. Eckstein,\n                      Splitting Methods for Monotone Operators with Applications to Parallel Optimization\n                      , Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 1989; available athttp:\/\/hdl.handle.net\/1721.1\/14356."},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.18.1.202"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"atypb17","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":"atypb18","first-page":"443","author":"Facchinei F.","year":"2009","journal-title":"Cambridge"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9331-9"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1137\/110853996"},{"key":"atypb21","first-page":"299","author":"Gabay D.","year":"1983","journal-title":"Amsterdam"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"atypb23","doi-asserted-by":"crossref","unstructured":"R. Glowinski, S. Osher, and W.T. Yin,\n                      Splitting Methods in Communication and Imaging, Science, and Engineering\n                      , Springer International Publishing, Switzerland, 2016.","DOI":"10.1007\/978-3-319-41589-5"},{"key":"atypb24","doi-asserted-by":"crossref","unstructured":"R. Glowinski and P. Le Tallec,\n                      Augmented Lagrangian and Operator-Splitting Methods in Nonlinear Mechanics\n                      , Stud. Appl. Numer. Math., SIAM, Philadelphia, PA, 1989.","DOI":"10.1137\/1.9781611970838"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2016.1227432"},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"T. Hastie, R. Tibshirani, and M. Wainwright.\n                      Statistical Learning with Sparsity: The Lasso and Generalizations\n                      , Monogr. Statist. Appl. Probab. 143, Chapman and Hall\/CRC Press, Boca Raton, FL, 2015.","DOI":"10.1201\/b18401"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1093\/imanum\/drt060"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1137\/110822347"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2015.2481563"},{"key":"atypb31","first-page":"1","author":"Le Thi H.A.","year":"2014","journal-title":"Heidelberg"},{"key":"atypb32","first-page":"25","volume":"133","author":"Le Thi H.A.","year":"2005","journal-title":"Ann. Oper. Res."},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"Y.F. Lou and M. Yan,\n                      Fast $L_1$-$L_2$ Minimization via a Proximal Operator\n                      , preprint, arXiv:1609.09530.v2, 2016.","DOI":"10.1007\/s10915-017-0463-2"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-014-9930-1"},{"key":"atypb36","unstructured":"B. Jiang, S. Ma, and S. Zhang,\n                      Alternating direction method of multipliers for real and complex polynomial optimization models\n                      , Technical report, 2013; available athttp:\/\/www.menet.umn.edu\/~zhangs\/Reports\/2013_JMZ.pdf."},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1137\/140998135"},{"key":"atypb38","doi-asserted-by":"crossref","unstructured":"B. Mordukhovich,\n                      Variational Analysis and Generalized Differentiation\n                      , Springer, Berlin, 2006.","DOI":"10.1007\/3-540-31247-1"},{"key":"atypb39","unstructured":"J.M. Orgeta and W.C. Rheinboldt,\n                      Iterative Solution of Nonlinear Equations in Several Variables\n                      , Classics Appl. Math. 30, SIAM, Philadelphia, PA, 2000."},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2016.0795"},{"key":"atypb41","first-page":"289","volume":"22","author":"Pham D.T.","year":"1997","journal-title":"Acta Math. Vietnam."},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1137\/120891009"},{"key":"atypb43","unstructured":"R.T. Rockafellar,\n                      Convex Analysis\n                      , Princeton University Press, Princeton, NJ, 1970."},{"key":"atypb44","unstructured":"R.T. Rockafellar and R.J.B. Wets,\n                      Variational Analysis\n                      , 3rd ed., Grundlehren Math. Wiss. 317, Springer, Berlin, Heidelberg, 2009."},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1137\/100781894"},{"key":"atypb46","unstructured":"F.H. Wang, Z.B. Xu, and H.K. Xu,\n                      Convergence of Bregman Alternating Direction Method with Multipliers for Nonconvex Composite Problems\n                      , preprint,https:\/\/arxiv.org\/pdf\/1410.8625v3.pdf, 2014."},{"key":"atypb47","unstructured":"Y. Wang, W.T. Yin and J.S. Zeng,\n                      Global Convergence of ADMM in Nonconvex Nonsmooth Optimization\n                      , preprint,https:\/\/arxiv.org\/pdf\/1511.06324v3.pdf, 2016."},{"key":"atypb48","unstructured":"F.H. Wang, W.F. Cao, and Z.B. Xu,\n                      Convergence of Multi-Block Bregman ADMM for Nonconvex Composite Problems\n                      , preprint,https:\/\/arxiv.org\/pdf\/1505.03063v1.pdf, 2015."},{"key":"atypb49","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/28\/11\/115010"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1007\/s11464-012-0194-5"},{"key":"atypb52","doi-asserted-by":"publisher","DOI":"10.1137\/140983938"},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1137\/120887795"},{"key":"atypb54","doi-asserted-by":"publisher","DOI":"10.1137\/140952363"},{"key":"atypb55","unstructured":"Y. Zhang,\n                      An Alternating Direction Algorithm for Nonnegative Matrix Factorization\n                      , Technical report, Rice University, Houston, TX, 2010; available athttp:\/\/www.caam.rice.edu\/~zhang\/reports\/tr1003.pdf."}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/17M1110249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:03:44Z","timestamp":1787339024000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/17M1110249"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":55,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/17M1110249"],"URL":"https:\/\/doi.org\/10.1137\/17m1110249","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}