A carregar...
The regularized CQ algorithm without a priori knowledge of operator norm for solving the split feasibility problem
The split feasibility problem (SFP) is finding a point [Formula: see text] such that [Formula: see text] , where C and Q are nonempty closed convex subsets of Hilbert spaces [Formula: see text] and [Formula: see text] , and [Formula: see text] is a bounded linear operator. Byrne’s CQ algorithm is an...
Na minha lista:
| Publicado no: | J Inequal Appl |
|---|---|
| Main Authors: | , |
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Springer International Publishing
2017
|
| Assuntos: | |
| Acesso em linha: | https://ncbi.nlm.nih.gov/pmc/articles/PMC5583313/ https://ncbi.nlm.nih.gov/pubmed/28943737 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13660-017-1480-2 |
| Tags: |
Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!
|