Extragradient-projection method for solving constrained convex minimization problems

Lu Chuan Ceng, Qamrul Hasan Ansari, Jen Chih Yao

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

In this paper, we introduce an iterative process for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a constrained convex minimization problem for a Fŕechet differentiable function. The iterative process is based on the so-called extragradientprojection method. We derive several weak convergence results for two sequences generated by the proposed iterative process. On the other hand, by applying the viscosity approximation method and the additional projection method (namely, the CQ method) to the extragradient-projection method, respectively, we also provide two modifications of the extragradient-projection method to obtain two strong convergence theorems. The results of this paper represent the supplement, improvement, extension and development of some known results given in the literature.

Original languageEnglish
Pages (from-to)341-359
Number of pages19
JournalNumerical Algebra, Control and Optimization
Volume1
Issue number3
DOIs
StatePublished - Sep 2011
Externally publishedYes

Keywords

  • Averaged mapping
  • Constrained convex minimization
  • Extragradient-projection method
  • Iterative processes
  • Nonexpansive mapping
  • Relaxed extragradient-projection method

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Control and Optimization
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Extragradient-projection method for solving constrained convex minimization problems'. Together they form a unique fingerprint.

Cite this