Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
DOI10.1016/J.JMAA.2016.11.018zbMATH Open1354.49059OpenAlexW2557006226MaRDI QIDQ730193FDOQ730193
Publication date: 23 December 2016
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2016.11.018
Recommendations
- Complexity of the relaxed Peaceman-Rachford splitting method for the sum of two maximal strongly monotone operators
- scientific article; zbMATH DE number 7544005
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Convergence analysis of an inexact three-operator splitting algorithm
- Convergence rates for the relaxed Peaceman-Rachford splitting method on a monotone inclusion problem
metric subregularitylinear convergenceoperator splitting methodsmonotone inclusion problemcomplexity rateover-relaxed hybrid proximal extragradient method
Set-valued operators (47H04) Monotone operators and generalizations (47H05) Variational and other types of inclusions (47J22) Iterative procedures involving nonlinear operators (47J25) Set-valued and variational analysis (49J53) Numerical methods of relaxation type (49M20)
Cites Work
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Variational Analysis
- Model Selection and Estimation in Regression with Grouped Variables
- Convex analysis and monotone operator theory in Hilbert spaces
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- Signal Recovery by Proximal Forward-Backward Splitting
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
- Implicit Functions and Solution Mappings
- Monotone Operators and the Proximal Point Algorithm
- Title not available (Why is that?)
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Title not available (Why is that?)
- Generalized equations and their solutions, Part I: Basic theory
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
- On linear convergence of iterative methods for the variational inequality problem
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- The Numerical Solution of Parabolic and Elliptic Differential Equations
- Title not available (Why is that?)
- Convergence Rates in Forward--Backward Splitting
- Forward-partial inverse-forward splitting for solving monotone inclusions
- Forward-Douglas–Rachford splitting and forward-partial inverse method for solving monotone inclusions
- Partial inverse of a monotone operator
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Applications of the method of partial inverses to convex programming: Decomposition
- A generalized forward-backward splitting
- A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
- On the convergence rate of Douglas-Rachford operator splitting method
- Title not available (Why is that?)
- A family of enlargements of maximal monotone operators
- Compositions and convex combinations of averaged nonexpansive operators
- Convergence Rate Analysis of the Forward-Douglas-Rachford Splitting Scheme
- Convex relaxation algorithm for a structured simultaneous low-rank and sparse recovery problem
- Local Linear Convergence of the ADMM/Douglas--Rachford Algorithms without Strong Convexity and Application to Statistical Imaging
This page was built for publication: Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730193)
