{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T06:48:10Z","timestamp":1790664490051,"version":"4.1.0"},"reference-count":33,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-CE23-0008"],"award-info":[{"award-number":["ANR-19-CE23-0008"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-19-P3IA-0003"],"award-info":[{"award-number":["ANR-19-P3IA-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2023,9,30]]},"abstract":"<jats:p>Abstract.<\/jats:p>\n                  <jats:p>We consider the problem of minimizing the composition of a nonsmooth function with a smooth mapping in the case where the proximity operator of the nonsmooth function can be explicitly computed. We first show that this proximity operator can provide the exact smooth substructure of minimizers, not only of the nonsmooth function, but also of the full composite function. We then exploit this proximal identification by proposing an algorithm which combines proximal steps with sequential quadratic programming steps. We show that our method locally identifies the optimal smooth substructure and then converges quadratically. We illustrate its behavior on two problems: the minimization of a maximum of quadratic functions and the minimization of the maximal eigenvalue of a parametrized matrix.<\/jats:p>","DOI":"10.1137\/22m1505827","type":"journal-article","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T04:02:27Z","timestamp":1692763347000},"page":"2222-2247","source":"Crossref","is-referenced-by-count":2,"title":["Harnessing Structure in Composite Nonsmooth Minimization"],"prefix":"10.1137","volume":"33","author":[{"given":"Gilles","family":"Bareilles","sequence":"first","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, LJK, 38400 Saint-Martin-d\u2019H\u00e8res, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2537-380X","authenticated-orcid":true,"given":"Franck","family":"Iutzeler","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, LJK, 38400 Saint-Martin-d\u2019H\u00e8res, France."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0371-0457","authenticated-orcid":true,"given":"J\u00e9r\u00f4me","family":"Malick","sequence":"additional","affiliation":[{"name":"Universit\u00e9 Grenoble Alpes, CNRS, Grenoble INP, LJK, 38400 Saint-Martin-d\u2019H\u00e8res, France."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2023,8,23]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01873-w"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01382-3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2015.0735"},{"key":"ref5","volume-title":"Numerical Optimization: Theoretical and Practical Aspects","author":"Bonnans J.-F.","year":"2006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34910-3_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/02331930600815884"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01432-w"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"X. Y. Han  and \nA. S. Lewis , Survey descent: A multipoint generalization of gradient descent for nonsmooth optimization, SIAM J. Optim., 33 (2023), pp. 36\u201362.","DOI":"10.1137\/21M1468450"},{"key":"ref11","first-page":"251","volume":"11","author":"Hare W.","year":"2004","journal-title":"J. Convex Anal."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0124-6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2013.858155"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7"},{"key":"ref15","unstructured":"C.p. Lee , Accelerating Inexact Successive Quadratic Approximation for Regularized Optimization through Manifold Identification, https:\/\/arxiv.org\/abs\/2012.02522, 2021."},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21752-9"},{"key":"ref17","unstructured":"A. Lewis  and \nT. Tian , Identifiability, the KL  Property in Metric Spaces, and Subgradient Curves, preprint, https:\/\/arxiv.org\/abs\/2205.02868, 2022."},{"key":"ref18","unstructured":"A. Lewis  and \nC. Wylie , A Simple Newton Method for Local Nonsmooth Optimization, https:\/\/arxiv.org\/abs\/1907.11742, 2019."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623401387623"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0514-2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0943-9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/110852103"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0630-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0631-2"},{"key":"ref25","volume-title":"Numerical Optimization","author":"Nocedal J.","year":"2006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0635-y"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0635-y"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623496311776"},{"key":"ref29","series-title":"Grundlehren Math. Wiss. 317","volume-title":"Variational Analysis","author":"Rockafellar R. T.","year":"2009"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0600-5"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1287\/moor.28.4.677.20512"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/0805028"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940574"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/22M1505827","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:21:41Z","timestamp":1787336501000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/22M1505827"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,23]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9,30]]}},"alternative-id":["10.1137\/22M1505827"],"URL":"https:\/\/doi.org\/10.1137\/22m1505827","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8,23]]}}}