Extragradient-projection method for solving constrained convex minimization problems

DOI10.3934/NACO.2011.1.341zbMATH Open1241.90098OpenAlexW2334125859MaRDI QIDQ428477FDOQ428477

Jen-Chih Yao, L. C. 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 mappingconstrained convex minimizationiterative processesaveraged mappingextragradient-projection methodrelaxed 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)

Cited In (17)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q428477)