On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
From MaRDI portal
Publication:4981841
DOI10.1080/02331934.2014.966306zbMath1476.47045OpenAlexW2077246107MaRDI QIDQ4981841
Ernö Robert Csetnek, Radu Ioan Boţ
Publication date: 20 March 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2014.966306
Numerical mathematical programming methods (65K05) Convex programming (90C25) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25)
Related Items (14)
Convergence analysis of primal-dual based methods for total variation minimization with finite element approximation ⋮ Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm ⋮ Convergence Rate Analysis of Primal-Dual Splitting Schemes ⋮ The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis ⋮ Variable smoothing for convex optimization problems using stochastic gradients ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport ⋮ Variable smoothing for weakly convex composite functions ⋮ Data-Driven Nonsmooth Optimization ⋮ Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration ⋮ Solving inverse problems using data-driven models ⋮ Convergence analysis of the stochastic reflected forward-backward splitting algorithm ⋮ On the nonexpansive operators based on arbitrary metric: a degenerate analysis ⋮ Tseng’s Algorithm with Extrapolation from the past Endowed with Variable Metrics and Error Terms
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
- Conjugate duality in convex optimization
- Image sharpening by flows based on triple well potentials
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization
- Regularity conditions via generalized interiority notions in convex optimization: New achievements and their relation to some classical statements
- A Monotone+Skew Splitting Model for Composite Monotone Inclusions in Duality
- Monotone Operators and the Proximal Point Algorithm
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Primal-Dual Splitting Algorithm for Finding Zeros of Sums of Maximal Monotone Operators
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
