Metraipolis › archive › dc_8fab2d747a73
Projected Subgradient Methods for a Class of Nonsmooth and Nonconvex Optimization Problems — arXiv:2609.02517
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02517
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:25:52.462Z
- SHA-256 of the archived text
acbf8949622cc1c9becf2b9b92df7e562129b4edace109c7d4aa84094b1b389a- Stable URL of this page
https://metraipolis.com/documento/dc_8fab2d747a73
How to cite
Projected Subgradient Methods for a Class of Nonsmooth and Nonconvex Optimization Problems — arXiv:2609.02517 — arXiv (en), https://arxiv.org/abs/2609.02517 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fab2d747a73 (Metraipolis archive dc_8fab2d747a73, sha256 acbf8949622cc1c9becf2b9b92df7e562129b4edace109c7d4aa84094b1b389a)
BibTeX
@misc{dc8fab2d747a73,
title = {Projected Subgradient Methods for a Class of Nonsmooth and Nonconvex Optimization Problems — arXiv:2609.02517},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02517},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fab2d747a73; sha256 acbf8949622cc1c9becf2b9b92df7e562129b4edace109c7d4aa84094b1b389a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02517. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We investigate the optimization problem of minimizing a nonsmooth function that satisfies a nonsmooth version of the descent lemma over a nonempty and closed but not necessarily convex set. The objective function belongs to the class of upper-$\mathcal{C}^2$ functions, whereas the constraints may promote a sparse or low-rank structure. We propose a projected subgradient method with two different globalization strategies: (a) a nonmonotone linesearch and, under additional assumptions, (b) an auto-conditioned method, where the stepsize is given by a formula depending on data from past iterations. We show that both methods converge to solutions that satisfy a stronger stationarity concept than one would expect from the subdifferential sum-rule, which is particularly important since the optimization problems of interest are inherently nonconvex. Finally, we present promising numerical results when applying the algorithm to an MPEC-style problem as well as the matrix optimization problems MAXCUT and Robust PCA.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-03 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.02517 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T04:44:15.060Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).