EUVIMEDEUVIMED entdecken
Crossref

Forward–Backward Algorithms for Weakly Convex Problems

Ewa Bednarczuk, Giovanni Bruccola, Gabriele Scrivanti, The Hung Tran

Applied Mathematics & Optimization · 2026-06 · 93 (3)

DOI: 10.1007/s00245-026-10420-4 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Applied Mathematics & Optimization, online erschienen am 17.04.2026. Verfasst von Ewa Bednarczuk und 3 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 55 Literaturangaben. Gefördert von: H2020 Marie Skłodowska-Curie Actions.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We investigate the convergence properties of exact and inexact forward–backward algorithms to minimize the sum of two weakly convex functions defined on a Hilbert space, where one has a Lipschitz-continuous gradient. We show that the exact forward–backward algorithm locally converges strongly to a global solution, provided that the objective function satisfies a sharpness condition. For the inexact forward–backward algorithm, the same condition ensures that the distance from the iterates to the solution set approaches a positive threshold depending on the accuracy level of the proximal computations. As an application of the considered setting, we provide numerical experiments related to discrete tomography.

Förderung

  • H2020 Marie Skłodowska-Curie Actions

Zitieren

APA

Bednarczuk, E., Bruccola, G., Scrivanti, G., & Tran, T. H. (2026). Forward–Backward Algorithms for Weakly Convex Problems. Applied Mathematics & Optimization, 93(3). https://doi.org/10.1007/s00245-026-10420-4

Vancouver

Bednarczuk E, Bruccola G, Scrivanti G, Tran TH. Forward–Backward Algorithms for Weakly Convex Problems. Applied Mathematics & Optimization. 2026;93(3). doi:10.1007/s00245-026-10420-4

BibTeX
@article{Bednarczuk2026,
  author = {Bednarczuk, Ewa and Bruccola, Giovanni and Scrivanti, Gabriele and Tran, The Hung},
  title = {Forward–Backward Algorithms for Weakly Convex Problems},
  journal = {Applied Mathematics & Optimization},
  year = {2026},
  volume = {93},
  number = {3},
  doi = {10.1007/s00245-026-10420-4}
}
Kostenlos starten →