A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
From MaRDI portal
Publication:467410
DOI10.1007/s10957-013-0449-7zbMath1311.90178arXiv1204.1353OpenAlexW2593675399MaRDI QIDQ467410
Publication date: 3 November 2014
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.1353
Related Items (11)
On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ A Hybrid Proximal-Extragradient Algorithm with Inertial Effects ⋮ Convergence rates with inexact non-expansive operators ⋮ A unified framework for solving generalized variational inequalities ⋮ On inexact relative-error hybrid proximal extragradient, forward-backward and Tseng's modified forward-backward methods with inertial effects ⋮ A two-phase rank-based algorithm for low-rank matrix completion ⋮ Inertial projection and contraction algorithms for variational inequalities ⋮ Over relaxed hybrid proximal extragradient algorithm and its application to several operator splitting methods ⋮ The extragradient algorithm with inertial effects for solving the variational inequality ⋮ 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 ⋮ A new algorithm for finding a common solution of a split variational inequality problem, the fixed point problems and the variational inclusion problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- Enlargement of monotone operators with applications to variational inequalities
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- \(\varepsilon\)-enlargements of maximal monotone operators in Banach spaces
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- 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
- Entropy-Like Proximal Methods in Convex Programming
- Full convergence of the steepest descent method with inexact line searches
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- A family of enlargements of maximal monotone operators
- Robustness of the hybrid extragradient proximal-point algorithm.
This page was built for publication: A class of Fejér convergent algorithms, approximate resolvents and the hybrid proximal-extragradient method
