Nonlinear Forward-Backward Splitting with Projection Correction
From MaRDI portal
Publication:5152477
DOI10.1137/20M1345062zbMath1477.90103arXiv1908.07449OpenAlexW3198477454MaRDI QIDQ5152477
Publication date: 24 September 2021
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.07449
forward-backward splittingmonotone inclusionsnonlinear resolventforward-backward-forward splittingfour-operator splitting
Related Items (11)
Projective splitting as a warped proximal algorithm ⋮ On compositions of special cases of Lipschitz continuous operators ⋮ A Nonlinearly Preconditioned Forward-Backward Splitting Method and Applications ⋮ A direct proof of convergence of Davis-Yin splitting algorithm allowing larger stepsizes ⋮ Cocoercivity, smoothness and bias in variance-reduced stochastic gradient methods ⋮ Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists ⋮ A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization ⋮ Nonlinear forward-backward splitting with momentum correction ⋮ Resolvent of the parallel composition and the proximity operator of the infimal postcomposition ⋮ Finding the forward-Douglas-Rachford-forward method ⋮ Degenerate Preconditioned Proximal Point Algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Combined relaxation method for mixed equilibrium problems
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Lectures on topics in finite element solution of elliptic problems. Notes by G. Vijayasundaram
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Approximate iterations in Bregman-function-based proximal algorithms
- Block-iterative surrogate projection methods for convex feasibility problems
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- Regularity and conditioning of solution mappings in variational analysis
- Combined relaxation methods for finding equilibrium points and solving related problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Warped proximal iterations for monotone inclusions
- Projective splitting with forward steps only requires continuity
- Iteration complexity of an inexact Douglas-Rachford method and of a Douglas-Rachford-Tseng's F-B four-operator splitting method for solving monotone inclusions
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Primal-dual proximal algorithms for structured convex optimization: a unifying framework
- A family of projective splitting methods for the sum of two maximal monotone operators
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- Implicit Functions and Solution Mappings
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Monotone Operators and the Proximal Point Algorithm
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
- Bregman Monotone Optimization Algorithms
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Modified Projection-Type Methods for Monotone Variational Inequalities
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Strong Convergence of Block-Iterative Outer Approximation Methods for Convex Optimization
- A New Randomized Block-Coordinate Primal-Dual Proximal Algorithm for Distributed Optimization
- Convergence Rates for Projective Splitting
- Signal Recovery by Proximal Forward-Backward Splitting
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima
- Convex analysis and monotone operator theory in Hilbert spaces
- A combined method for variational inequalities with monotone operators
This page was built for publication: Nonlinear Forward-Backward Splitting with Projection Correction
