Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense (Q370269): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / author | |||
Property / author: Ching-Feng Wen / rank | |||
Normal rank | |||
Property / review text | |||
Summary: We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping \(S\) in the intermediate sense and the set of solutions of the minimization problem (MP) for a convex and continuously Fréchet differentiable functional in the setting of Hilbert spaces. The implicit relaxed method with regularization is based on three well-known methods: the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization. We derive a weak convergence theorem for two sequences generated by this method. On the other hand, we also prove a new strong convergence theorem by an implicit hybrid method with regularization for the MP and the mapping \(S\). The implicit hybrid method with regularization is based on four well-known methods: the CQ method, the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization. | |||
Property / review text: Summary: We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping \(S\) in the intermediate sense and the set of solutions of the minimization problem (MP) for a convex and continuously Fréchet differentiable functional in the setting of Hilbert spaces. The implicit relaxed method with regularization is based on three well-known methods: the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization. We derive a weak convergence theorem for two sequences generated by this method. On the other hand, we also prove a new strong convergence theorem by an implicit hybrid method with regularization for the MP and the mapping \(S\). The implicit hybrid method with regularization is based on four well-known methods: the CQ method, the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47J25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 47H09 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65J20 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6209473 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
implicit relaxed method with regularization | |||
Property / zbMATH Keywords: implicit relaxed method with regularization / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
fixed points | |||
Property / zbMATH Keywords: fixed points / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
asymptotically strict pseudocontractive mapping | |||
Property / zbMATH Keywords: asymptotically strict pseudocontractive mapping / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
minimization problem | |||
Property / zbMATH Keywords: minimization problem / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
strong convergence | |||
Property / zbMATH Keywords: strong convergence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
implicit hybrid method with regularization | |||
Property / zbMATH Keywords: implicit hybrid method with regularization / rank | |||
Normal rank |
Revision as of 13:38, 28 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense |
scientific article |
Statements
Implicit relaxed and hybrid methods with regularization for minimization problems and asymptotically strict pseudocontractive mappings in the intermediate sense (English)
0 references
19 September 2013
0 references
Summary: We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping \(S\) in the intermediate sense and the set of solutions of the minimization problem (MP) for a convex and continuously Fréchet differentiable functional in the setting of Hilbert spaces. The implicit relaxed method with regularization is based on three well-known methods: the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization. We derive a weak convergence theorem for two sequences generated by this method. On the other hand, we also prove a new strong convergence theorem by an implicit hybrid method with regularization for the MP and the mapping \(S\). The implicit hybrid method with regularization is based on four well-known methods: the CQ method, the extragradient method, the viscosity approximation method, and the gradient projection algorithm with regularization.
0 references
implicit relaxed method with regularization
0 references
fixed points
0 references
asymptotically strict pseudocontractive mapping
0 references
minimization problem
0 references
strong convergence
0 references
implicit hybrid method with regularization
0 references