Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of British Columbia

$16,000.00

Convex Analysis, monotone operators and projection algorithms

FY 2008-09

Summary
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. Projection algorithms are iterative methods for solving convex feasibility problems. A solution is approximated by combining the projections onto the constraints. The most famous of these methods, POCS (Projections Onto Convex Sets), generates a sequence by projecting cyclically onto the constraints. In my research, I will investigate the behaviour of POCS in the inconsistent case. This is important in practice since - due to measurement errors or "noisy data" - a convex feasibility problem may fail to have any solution. My aim is to explain the asymptotic behaviour of POCS, which will help users of POCS to interpret the data it produces. To achieve this goal, the inconsistent case of POCS will be analyzed within the broader context of duality theory for finding zeros of the sum of maximal monotone operators. I will also explore corresponding questions for proximal mappings, which are basic building blocks of modern convex optimization algorithms. In addition, the acceleration of projection algorithms will be examined both theoretically and practically. The practical part of this research, carried out by a team of researchers from UBC Okanagan and from the B.C. Cancer agency, will focus on the Intensity Modulated Radiotherapy Treatment planning problem.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
216877-2008
Name nom
Bauschke, Heinz
Department département
Okanagan - Mathematics, Statistics and Physics Unit
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
16000
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
336
Committee name en
Pure & Applied Maths - A
Committee name fr
Maths pures et appliquées - A
Area of application code
1205
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Mathematical sciences
Area of application fr
Sciences mathématiques
Research subject code
2956
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Optimisation and optimal control theory
Research subject fr
Optimisation et théories de commande optimale
Partie
1
Nb partie
5
Application title
Convex Analysis, monotone operators and projection algorithms
Keyword
NA
Application summary
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. Projection algorithms are iterative methods for solving convex feasibility problems. A solution is approximated by combining the projections onto the constraints. The most famous of these methods, POCS (Projections Onto Convex Sets), generates a sequence by projecting cyclically onto the constraints. In my research, I will investigate the behaviour of POCS in the inconsistent case. This is important in practice since - due to measurement errors or "noisy data" - a convex feasibility problem may fail to have any solution. My aim is to explain the asymptotic behaviour of POCS, which will help users of POCS to interpret the data it produces. To achieve this goal, the inconsistent case of POCS will be analyzed within the broader context of duality theory for finding zeros of the sum of maximal monotone operators. I will also explore corresponding questions for proximal mappings, which are basic building blocks of modern convex optimization algorithms. In addition, the acceleration of projection algorithms will be examined both theoretically and practically. The practical part of this research, carried out by a team of researchers from UBC Okanagan and from the B.C. Cancer agency, will focus on the Intensity Modulated Radiotherapy Treatment planning problem.