Metraipolis › archive › dc_97ad80cc8ea6

Convergence Analysis of an Inexact Proximal Trust-Region Method — arXiv:2609.26747

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.26747
License (as archived)
CC0-1.0
Archived
2026-10-08T15:53:22.731Z
SHA-256 of the archived text
39fa26a99b028239c4119a5a9420f6f67ddaaf4ccfe1fe7717055709d4f906e9
Stable URL of this page
https://metraipolis.com/documento/dc_97ad80cc8ea6

How to cite

Convergence Analysis of an Inexact Proximal Trust-Region Method — arXiv:2609.26747 — arXiv (en), https://arxiv.org/abs/2609.26747 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_97ad80cc8ea6 (Metraipolis archive dc_97ad80cc8ea6, sha256 39fa26a99b028239c4119a5a9420f6f67ddaaf4ccfe1fe7717055709d4f906e9)
BibTeX
@misc{dc97ad80cc8ea6,
  title = {Convergence Analysis of an Inexact Proximal Trust-Region Method — arXiv:2609.26747},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.26747},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_97ad80cc8ea6; sha256 39fa26a99b028239c4119a5a9420f6f67ddaaf4ccfe1fe7717055709d4f906e9},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.26747. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We analyze an inexact, proximal trust-region algorithm for minimizing the sum of a smooth nonconvex function and a nonsmooth convex function. Our algorithm leverages the proximal gradient as a benchmark to guarantee global convergence. However, evaluating the proximal gradient involves solving a nonsmooth convex optimization problem that in many applications cannot be performed exactly. As such, we develop a framework that permits inexact evaluations of the proximity operator and we show the proposed inexactness conditions yield descent properties analogous to the exact proximal gradient. We further discuss practical procedures for computing approximate proximity operators for two common applications: (i) the nonsmooth term is the sum of nonsmooth convex functions where one is composed with an affine map and (ii) using alternative inner products to facilitate the evaluation of the proximity operator. We demonstrate our algorithm and confirm our analysis with two numerical experiments arising in PDE-constrained optimization.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-23 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.26747 — 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-08T15:12:09.748Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-23?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).