Algorithmic approach to a minimization problem (Q448663): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Kang, Shin Min / rank | |||
Normal rank | |||
Property / review text | |||
Summary: We first construct an implicit algorithm for solving the minimization problem \(\min_{x \in \Omega} ||x||\), where \(\Omega\) is the intersection set of the solution set of some equilibrium problem, the fixed-point 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. | |||
Property / review text: Summary: We first construct an implicit algorithm for solving the minimization problem \(\min_{x \in \Omega} ||x||\), where \(\Omega\) is the intersection set of the solution set of some equilibrium problem, the fixed-point 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 49M30 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47H09 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6078712 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimization problem | |||
Property / zbMATH Keywords: minimization problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed-point set of a nonexpansive mapping | |||
Property / zbMATH Keywords: fixed-point set of a nonexpansive mapping / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
variational inequality | |||
Property / zbMATH Keywords: variational inequality / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
discretizing an implicit algorithm | |||
Property / zbMATH Keywords: discretizing an implicit algorithm / rank | |||
Normal rank |
Revision as of 10:43, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic approach to a minimization problem |
scientific article |
Statements
Algorithmic approach to a minimization problem (English)
0 references
7 September 2012
0 references
Summary: We first construct an implicit algorithm for solving the minimization problem \(\min_{x \in \Omega} ||x||\), where \(\Omega\) is the intersection set of the solution set of some equilibrium problem, the fixed-point 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.
0 references
minimization problem
0 references
fixed-point set of a nonexpansive mapping
0 references
variational inequality
0 references
discretizing an implicit algorithm
0 references