A generalized forward-backward splitting operator: degenerate analysis and applications
From MaRDI portal
Publication:2685263
DOI10.1007/s40314-022-02143-3OpenAlexW4311351505MaRDI QIDQ2685263
Publication date: 20 February 2023
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.02064
degenerate metricoperator splitting algorithmsgeneralized forward-backward splitting (G-FBS)nonexpansive properties
Analysis of algorithms and problem complexity (68Q25) Convex programming (90C25) Monotone operators and generalizations (47H05) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Convergence rates with inexact non-expansive operators
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Compositions and convex combinations of averaged nonexpansive operators
- Dualization of signal recovery problems
- A three-operator splitting scheme and its optimization applications
- Variable metric quasi-Fejér monotonicity
- A class of ADMM-based algorithms for three-block separable convex programming
- A class of customized proximal point algorithms for linearly constrained convex optimization
- A block coordinate variable metric forward-backward algorithm
- Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach
- An inertial forward-backward algorithm for monotone inclusions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A simplified view of first order methods for optimization
- An algorithmic framework of generalized primal-dual hybrid gradient methods for saddle point problems
- On the optimal linear convergence rate of a generalized proximal point algorithm
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A parameterized proximal point algorithm for separable convex optimization
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Bregman forward-backward operator splitting
- On the nonexpansive operators based on arbitrary metric: a degenerate analysis
- Warped proximal iterations for monotone inclusions
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Backward-forward algorithms for structured monotone inclusions in Hilbert spaces
- A proximal point analysis of the preconditioned alternating direction method of multipliers
- Primal-dual proximal algorithms for structured convex optimization: a unifying framework
- Generalized alternating direction method of multipliers: new theoretical insights and applications
- Resolvent of the parallel composition and the proximity operator of the infimal postcomposition
- A Generalized Forward-Backward Splitting
- Proximal Splitting Methods in Signal Processing
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
- On Weak Convergence of the Douglas–Rachford Method
- On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Variational Analysis
- Bregman Monotone Optimization Algorithms
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- First-Order Methods in Optimization
- Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization
- A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Large-Scale Convex Optimization
- Fixed Point Strategies in Data Science
- A Generalized Proximal Point Algorithm and Its Convergence Rate
- Self Equivalence of the Alternating Direction Method of Multipliers
- Signal Recovery by Proximal Forward-Backward Splitting
- Variable metric forward–backward splitting with applications to monotone inclusions in duality
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
- A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions
