
doi: 10.1155/2012/410137
The projected‐gradient method is a powerful tool for solving constrained convex optimization problems and has extensively been studied. In the present paper, a projected‐gradient method is presented for solving the minimization problem, and the strong convergence analysis of the suggested gradient projection method is given.
strong convergence, Iterative procedures involving nonlinear operators, QA1-939, Existence theories for problems in abstract spaces, projected-gradient method, constrained convex optimization, Mathematics
strong convergence, Iterative procedures involving nonlinear operators, QA1-939, Existence theories for problems in abstract spaces, projected-gradient method, constrained convex optimization, Mathematics
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
