Extragradient-projection method for solving constrained convex minimization problems

DOI10.3934/NACO.2011.1.341MaRDI QIDQ428477zbMATH OpenOpenAlexFDO

Authors L. C. Ceng, Jen-Chih Yao, 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

averaged mappingconstrained convex minimizationextragradient-projection methoditerative processesnonexpansive mappingrelaxed extragradient-projection method

Mathematics Subject Classification ID

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

Recommendations

• Some iterative methods for finding fixed points and for solving constrained convex minimization problems
• On the relaxed hybrid-extragradient method for solving constrained convex minimization problems in Hilbert spaces
• Extragradient method for convex minimization problem
• A general iterative method for solving constrained convex minimization problems
• Regularized gradient-projection methods for equilibrium and constrained convex minimization problems

Cited in

(21)

• 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
• Strong convergence of a self-adaptive method for the split feasibility problem
• Generalized extragradient iterative methods for solving split feasibility and fixed point problems in Hilbert spaces
• Extragradient method for convex minimization problem
• A relaxed extragradient-like method for a class of constrained optimization problem
• 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
• scientific article; zbMATH DE number 4101955 (Why is no real title available?)
• 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
• Projection and contraction methods for constrained convex minimization problem and the zero points of maximal monotone operator
• scientific article; zbMATH DE number 7606924 (Why is no real title available?)
• Regularized gradient-projection methods for finding the minimum-norm solution of the constrained convex minimization problem
• A new method with regularization for solving split variational inequality problems in real Hilbert spaces
• Generalized relaxed inertial method with regularization for solving split feasibility problems in real Hilbert spaces
• scientific article; zbMATH DE number 7333648 (Why is no real title available?)
• 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
• Solution of variational inequality problems using monotone mapping
• A gradient projection algorithm based on the normal-S iterative algorithm: convergence analysis and machine learning application

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)