Convex Analysis, Monotone Operator Theory and Algorithms

凸分析、单调算子理论与算法

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

Numerous problems in mathematics, engineering and the physical sciences may be modelled as a feasibility problem, which asks to find a solution satisfying various given constraints. A classical example is to find a solution to a system of linear equations. In many cases, the constraints allow us to compute the projection or nearest point mapping. Indeed, projection methods are popular iterative procedure to solve feasibility problems using the projections of the constraints.

数学、工程和物理科学中的许多问题都可以建模为可行性问题，它要求找到满足各种给定约束的解决方案。一个经典的例子是求线性方程组的解。在许多情况下，约束允许我们计算投影或最近点映射。实际上，投影法是利用约束的投影来求解可行性问题的一种流行的迭代方法。