Variant gradient projection methods for the minimization problems (Q448815): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q58696798, #quickstatements; #temporary_batch_1710289860281 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q58696798 / rank | |||
Normal rank | |||
Revision as of 02:31, 13 March 2024
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
