Metraipolis › archive › dc_2aabac78b8eb

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints — Europe PMC PMID:41194973

Source
Europe PMC (en)
Original
https://europepmc.org/article/MED/41194973
DOI
10.1007/s10915-[numero omesso]-9
License (as archived)
solo-consultazione
Archived
2026-11-08T19:54:21.877Z
SHA-256 of the archived text
32a62b5ffd99a61b5ef772e6bd10924123807163bf720db4143e3a29986921ba
Stable URL of this page
https://metraipolis.com/documento/dc_2aabac78b8eb

How to cite

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints — Europe PMC PMID:41194973 — Europe PMC (en), https://europepmc.org/article/MED/41194973 (solo-consultazione); archived copy: https://metraipolis.com/documento/dc_2aabac78b8eb (Metraipolis archive dc_2aabac78b8eb, sha256 32a62b5ffd99a61b5ef772e6bd10924123807163bf720db4143e3a29986921ba)
BibTeX
@misc{dc2aabac78b8eb,
  title = {Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints — Europe PMC PMID:41194973},
  howpublished = {Europe PMC (en)},
  url = {https://europepmc.org/article/MED/41194973},
  note = {License solo-consultazione; archived copy https://metraipolis.com/documento/dc_2aabac78b8eb; sha256 32a62b5ffd99a61b5ef772e6bd10924123807163bf720db4143e3a29986921ba},
  year = {2026}
}

Archived text

The text is not reproduced here: the archive holds it as solo-consultazione (consultation only, no republication). Read it at the original source: https://europepmc.org/article/MED/41194973. Agents can read the archived copy with the MCP tool read_document.