Extragradient-projection method for solving constrained convex minimization problems

DOI10.3934/naco.2011.1.341zbMath1241.90098OpenAlexW2334125859MaRDI QIDQ428477

Jen-Chih Yao, Lu-Chuan Ceng, Qamrul Hasan Ansari

Publication date: 22 June 2012

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2011.1.341

zbMATH Keywords

nonexpansive mapping iterative processes constrained convex minimization averaged mapping extragradient-projection method relaxed extragradient-projection method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Related Items

Methods for solving constrained convex minimization problems and finding zeros of the sum of two operators in Hilbert spaces ⋮ Weak convergence theorem for variational inequality problems with monotone mapping in Hilbert space ⋮ Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces ⋮ Unnamed Item ⋮ Iterative algorithms with regularization for hierarchical variational inequality problems and convex minimization problems ⋮ Iterative algorithms for monotone inclusion problems, fixed point problems and minimization problems ⋮ Inertial extrapolation method with regularization for solving a new class of bilevel problem in real Hilbert spaces ⋮ Self-adaptive method for solving multiple set split equality variational inequality and fixed point problems in real Hilbert spaces ⋮ On solving of constrained convex minimize problem using gradient projection method ⋮ Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ Regularized gradient-projection methods for the constrained convex minimization problem and the zero points of maximal monotone operator ⋮ Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces

This page was built for publication: Extragradient-projection method for solving constrained convex minimization problems