.png){kind=icon}
返回
Projection algorithms for solving convex feasibility problems
.png){kind=icon}
OA
AI
DOI：10.1137/S0036144593251710.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Due to their extraordinary utility and broad applicability in many areas of classical mathematics and modern physical sciences (most notably, computerized tomography), algorithms for solving convex feasibility problems continue to receive great attention. To unify, generalize, and review some of these algorithms, a very broad and flexible framework is investigated. Several crucial new concepts which allow a systematic discussion of questions on behaviour in general Hilbert spaces and on the quality of convergence are brought out. Numerous examples are given.
Keyword:
angle between two subspaces
averaged mapping
Cimmino's method
computerized tomography
convex feasibility problem
convex function
convex inequalities
convex programming
convex set
Fejer monotone sequence
firmly nonexpansive mapping
Hilbert space
image recovery
iterative method
Kaczmarz's method
linear convergence
linear feasibility problem
linear inequalities
nonexpansive mapping
orthogonal projection
projection algorithm
projection method
Slater point
subdifferential
subgradient
subgradient algorithm
successive projections
期刊
IF:
6.1
论文数:
888
被引数:
1.2W
机构
暂无机构信息
引用论文
分享收藏Isolation and Characterization of Inositol-Containing Glycosphingolipids from Aspergillus niger
PREAI
分享收藏Imaging Protein‐Protein Interactions by Fluorescence Resonance Energy Transfer (FRET) Microscopy
PREAI
分享收藏Total Synthesis of (S)-(+)- and (R)-(-)-Curcudiols Based on 1,2-Aryl Migration via Phenonium Ion.png)
HETEROCYCLESOAAI
HETEROCYCLESIF0
OAAI分享收藏Rhodium-Catalyzed Diastereoselective Coupling of Propargylic Oxiranes with Arylboronic Acids in WaterHETEROCYCLES
OAAI
HETEROCYCLESIF0
OAAI分享收藏
查看更多内容