applied mathematics
分裂可行性问题
Split feasibility problemA mathematical framework used to find a point in the intersection of two closed convex sets in a Hilbert space, often formulated as finding a point x in C such that Ax is in Q. / 一种用于在希尔伯特空间中寻找两个闭凸集交集点的数学框架，通常表述为寻找满足 Ax 属于 Q 的点 x。
- Knowledge type
- 数学理论
- First proposed or discovered
- Proposer
- Turkey Farm member
- Creator
- 农场主
- Last updated
- 2026-10-23 20:01:23
Sub-knowledge points
No connected node yet
Higher-order knowledge points
No connected node yet
Main parameters and performance indicators
C: Closed convex setQ: Closed convex setA: Linear operator
Open problems
No unresolved problem recorded yet
Related literature
ranked by community starsAn inertial algorithm for the general split feasibility problem with an application to bandwidth allocationOpen source
Related products and links
No item recorded yet
Creation and modification trail
1 recordsRecord title: Split feasibility problem.
Node update feedback
review required