EUVIMEDEUVIMED entdecken
Crossref

Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem

Jiayi Song, Biao Qu, Danping Yang

Theoretical Computer Science · 2026-11 · 116327

DOI: 10.1016/j.tcs.2026.116327 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-11. Verfasst von Jiayi Song und 2 weiteren Autor:innen. Die Arbeit nennt 36 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Song, J., Qu, B., & Yang, D. (2026). Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem. Theoretical Computer Science, 116327. https://doi.org/10.1016/j.tcs.2026.116327

Vancouver

Song J, Qu B, Yang D. Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem. Theoretical Computer Science. 2026:116327. doi:10.1016/j.tcs.2026.116327

BibTeX
@article{Song2026,
  author = {Song, Jiayi and Qu, Biao and Yang, Danping},
  title = {Inertial Bregman proximal alternating linearized minimization method with line search for non-convex split feasibility problem},
  journal = {Theoretical Computer Science},
  year = {2026},
  pages = {116327},
  doi = {10.1016/j.tcs.2026.116327}
}
Kostenlos starten →