A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
From MaRDI portal
(Redirected from Publication:255085)
Recommendations
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- A inertial hybrid proximal extragradient method for solving monotone inclusions
- Inertial hybrid inexact proximal point method for solving monotone inclusions problems
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Cites work
- scientific article; zbMATH DE number 3551792 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
- A first-order block-decomposition method for solving two-easy-block structured semidefinite programs
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- 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
- Enlargement of monotone operators with applications to variational inequalities
- Forcing strong convergence of proximal point iterations in a Hilbert space
- Implementation of a block-decomposition algorithm for solving large-scale conic semidefinite programming problems
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Monotone Operators and the Proximal Point Algorithm
- On the Subdifferentiability of Convex Functions
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Solving strongly monotone variational and quasi-variational inequalities
Cited in
(9)- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- A hybrid proximal algorithm for the sum of monotone operators with multivalued mappings
- A inertial hybrid proximal extragradient method for solving monotone inclusions
- Extragradient-Type Methods with $\mathcal{O} (1/k)$ Last-Iterate Convergence Rates for Co-Hypomonotone Inclusions
- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- A hybrid proximal extragradient self-concordant primal barrier method for monotone variational inequalities
- On the relation between bundle methods for maximal monotone inclusions and hybrid proximal point algorithms
- A Hybrid Extragradient-Viscosity Method for Monotone Operators and Fixed Point Problems
This page was built for publication: A variant of the hybrid proximal extragradient method for solving strongly monotone inclusions and its complexity analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q255085)
