Convex Analysis, monotone operators and projection algorithms

凸分析、单调算子和投影算法

• 批准号: 216877-2008
• 负责人: Bauschke, Heinz
• 金额: $ 1.17万
• 依托单位: University of British Columbia
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2012
• 资助国家: 加拿大
• 起止时间: 2012-01-01 至 2013-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=503643
• 关键词: Convex; Analysis; monotone; operators; projection

The convex feasibility problem asks to find a point (a "solution") in the intersection of nonempty closed convex sets (the "constraints") in some Hilbert space. It is of fundamental importance in mathematics and the physical sciences due to the large number of problems that can be formulated as convex feasibility problems.

凸可行性问题要求在某个希尔伯特空间中的非空闭凸集（“约束”）的交集中找到一个点（“解”）。它在数学和物理科学中具有根本的重要性，因为大量的问题可以被公式化为凸可行性问题。