Cargando…
New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
Variable stepsize methods are effective for various modified CQ algorithms to solve the split feasibility problem (SFP). The purpose of this paper is first to introduce two new simpler variable stepsizes of the CQ algorithm. Then two new generalized variable stepsizes which can cover the former ones...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer International Publishing
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5488062/ https://www.ncbi.nlm.nih.gov/pubmed/28680238 http://dx.doi.org/10.1186/s13660-017-1409-9 |