Variant gradient projection methods for the minimization problems (Q448815): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
Summary: The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithms which have strong convergence. Motivated by Xu's work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed. | |||
| Property / review text: Summary: The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithms which have strong convergence. Motivated by Xu's work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 49M37 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C52 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6078810 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
gradient projection algorithm: constrained convex minimization problems | |||
| Property / zbMATH Keywords: gradient projection algorithm: constrained convex minimization problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
weak convergence in infinite-dimensional Hilbert spaces | |||
| Property / zbMATH Keywords: weak convergence in infinite-dimensional Hilbert spaces / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
strong convergence. | |||
| Property / zbMATH Keywords: strong convergence. / rank | |||
Normal rank | |||
Revision as of 10:46, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variant gradient projection methods for the minimization problems |
scientific article |
Statements
Variant gradient projection methods for the minimization problems (English)
0 references
7 September 2012
0 references
Summary: The gradient projection algorithm plays an important role in solving constrained convex minimization problems. In general, the gradient projection algorithm has only weak convergence in infinite-dimensional Hilbert spaces. Recently, H. K. Xu (2011) provided two modified gradient projection algorithms which have strong convergence. Motivated by Xu's work, in the present paper, we suggest three more simpler variant gradient projection methods so that strong convergence is guaranteed.
0 references
gradient projection algorithm: constrained convex minimization problems
0 references
weak convergence in infinite-dimensional Hilbert spaces
0 references
strong convergence.
0 references
