Fast reflected forward-backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints (Q6897789)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 8123803
Language Label Description Also known as
default for all languages
No label defined
    English
    Fast reflected forward-backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints
    scientific article; zbMATH DE number 8123803

      Statements

      Fast reflected forward-backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints (English)
      0 references
      0 references
      0 references
      0 references
      19 November 2025
      0 references
      monotone inclusion
      0 references
      reflected forward-backward splitting algorithm
      0 references
      Nesterov momentum
      0 references
      Lyapunov analysis
      0 references
      fast convergence rates
      0 references
      convergence of the iterates
      0 references
      saddle point problem
      0 references
      fast primal-dual algorithm
      0 references
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references