Metraipolis › archive › dc_bfaa15322283
A projected descent method for minimization of weakly semismooth functions over polyhedral sets — arXiv:2609.36282
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36282
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:01:58.461Z
- SHA-256 of the archived text
465e186270b35056b6356b02a5939ed445861eaff58c9e55d742ef9b9d9f3054- Stable URL of this page
https://metraipolis.com/documento/dc_bfaa15322283
How to cite
A projected descent method for minimization of weakly semismooth functions over polyhedral sets — arXiv:2609.36282 — arXiv (en), https://arxiv.org/abs/2609.36282 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bfaa15322283 (Metraipolis archive dc_bfaa15322283, sha256 465e186270b35056b6356b02a5939ed445861eaff58c9e55d742ef9b9d9f3054)
BibTeX
@misc{dcbfaa15322283,
title = {A projected descent method for minimization of weakly semismooth functions over polyhedral sets — arXiv:2609.36282},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36282},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bfaa15322283; sha256 465e186270b35056b6356b02a5939ed445861eaff58c9e55d742ef9b9d9f3054},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36282. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This study develops a projection-based descent method for minimizing weakly semismooth functions over polyhedral sets, taking an initial step toward extending projection-based descent algorithms to nonsmooth, nonconvex optimization problems. At each iteration, the method considers an inner approximation of the Clarke $\varepsilon$-subdifferential at the current iterate over the feasible region and uses its least-norm element to generate a search direction. An exponential limited backtracking line search is then developed to assess the quality of the generated direction, while a projected variant of Mifflin's line search is proposed to identify nonredundant subgradients that enrich the Clarke $\varepsilon$-subdifferential approximation when necessary. To quantify stationarity, a characterization of stationary points based on the projection operator yields a computable optimality measure for the proposed method. The convergence properties of the proposed method are established under mild assumptions. If the algorithm generates infinitely many serious steps, we identify two subsequences such that every cluster point of each subsequence is stationary. If the number of serious steps is finite, we show that the final serious step generates a stationary point. Numerical experiments demonstrate the efficiency and broad applicability of the proposed method across a wide range of test problems, including applications in image denoising, multiobjective optimization, and data clustering. To extend the applicability of the proposed method to problems with general smooth nonlinear constraints, we propose a heuristic approach based on sequential linearization. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.36282 — 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-07T17:35:03.532Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).