Algorithmic Approach to a Minimization Problem
Joint Authors
Kang, Shin Min
Wu, Zhitao
Liou, Yeong-Cheng
Yao, Yonghong
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-17, 17 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-07-08
Country of Publication
Egypt
No. of Pages
17
Main Subjects
Abstract EN
We first construct an implicit algorithm for solving the minimization problem minx∈Ω∥x∥ , where Ω is the intersection set of the solution set of some equilibrium problem, the fixed points set of a nonexpansive mapping, and the solution set of some variational inequality.
Further, we suggest an explicit algorithm by discretizing this implicit algorithm.
We prove that the proposed implicit and explicit algorithms converge strongly to a solution of the above minimization problem.
American Psychological Association (APA)
Yao, Yonghong& Kang, Shin Min& Liou, Yeong-Cheng& Wu, Zhitao. 2012. Algorithmic Approach to a Minimization Problem. Abstract and Applied Analysis،Vol. 2012, no. 2012, pp.1-17.
https://search.emarefa.net/detail/BIM-462495
Modern Language Association (MLA)
Yao, Yonghong…[et al.]. Algorithmic Approach to a Minimization Problem. Abstract and Applied Analysis No. 2012 (2012), pp.1-17.
https://search.emarefa.net/detail/BIM-462495
American Medical Association (AMA)
Yao, Yonghong& Kang, Shin Min& Liou, Yeong-Cheng& Wu, Zhitao. Algorithmic Approach to a Minimization Problem. Abstract and Applied Analysis. 2012. Vol. 2012, no. 2012, pp.1-17.
https://search.emarefa.net/detail/BIM-462495
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-462495