A unified hybrid iterative method for hierarchical minimization problems

  • D. R. Sahu
  • , Q. H. Ansari*
  • , J. C. Yao
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

In this paper, we introduce and analyze a new unified hybrid iterative method to compute the approximate solution of the general optimization problem defined over the set D=Fix(T)∩Ω[GMEP(Φ,Ψ,φ)], where Fix(T) is the set of common fixed points of a family T=T(t):0≤t<∞ of nonexpansive self-mappings on a Hilbert space H, and Ω[GMEP(Φ,Ψ,)] is the set of solutions of the generalized mixed equilibrium problem (in short, GMEP). Such type of minimization problem is called the hierarchical minimization problem. We establish the strong convergence of the sequences generated by the proposed algorithm. Our strong convergence theorem extends, improves and unifies the previously known results in the literature. We also give a numerical example to illustrate our algorithm and results.

Original languageEnglish
Pages (from-to)208-221
Number of pages14
JournalJournal of Computational and Applied Mathematics
Volume253
DOIs
StatePublished - 2013

Keywords

  • Hierarchical minimization problems
  • Hybrid iterative method
  • Maximal monotone operators
  • Metric projection mappings
  • Proximal point algorithm
  • Resolvent operators

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'A unified hybrid iterative method for hierarchical minimization problems'. Together they form a unique fingerprint.

Cite this