Article Contents
Article Contents

# A relaxed extragradient-like method for a class of constrained optimization problem

• This paper presents a relaxed extragradient-like method for solving the convexly constrained minimization with optimal value zero. The method is a combination of the extragradient-like algorithm and a halfspace-relaxation technique to the constrained set of the problem. Each iteration of the proposed method consists of the projection onto a halfspace containing the given closed convex set. The method is implemented very easily and is proven to be fully convergent to the solution. Preliminary computational experience is also reported.
Mathematics Subject Classification: Primary: 90C25; Secondary: 65K05.

 Citation: