Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

University of British Columbia

$29,000.00

Convex Analysis, Monotone Operator Theory and Algorithms

EF 2013-14

Résumé
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. Projection methods have fascinated several outstanding researchers including John von Neumann, Norbert Wiener and Nobel prize winner Sir Godfrey Hounsfield who used these methods in the first Computer-Aided Tomography (CAT) scanner. Today, these methods continue to be of great interest in classical and modern areas such as crystallography and sparse feasibility, where the constraints are often non-convex. While a large body of results and algorithms exists, there are still many tantalizing important open problems including: 1) What can be said when the constraints are non-convex? 2) What happens if there is no solution (e.g., due to measurement errors)? 3) Can these methods be modified to work for more general optimization problems? 4) What happens if we apply projections that are based on non-Euclidean distances? I shall use modern tools from Convex Analysis, Monotone Operator Theory and Variational Analysis to advance the knowledge of projection methods and to make progress on the four open problem listed above. The skills my students and postdoctoral fellows will acquire will prepare them for successful careers in academia and industry which are critical to maintaining Canada's leadership in Science and Engineering.
Programme
Discovery Grants Program - Individual
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
216877-2013
Name nom
Bauschke, Heinz
Department département
Okanagan - Computer Science, Mathematics, Physics and Statistics
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
2013
Competition year année de concours
2013
Award amount
29000
Program id
RGPIN
Program name 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
1508
Committee name en
Mathematics and Statistics
Committee name fr
Mathématiques et statistique
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 Operator Theory and Algorithms
Keyword
NSERC
Application summary
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. Projection methods have fascinated several outstanding researchers including John von Neumann, Norbert Wiener and Nobel prize winner Sir Godfrey Hounsfield who used these methods in the first Computer-Aided Tomography (CAT) scanner. Today, these methods continue to be of great interest in classical and modern areas such as crystallography and sparse feasibility, where the constraints are often non-convex. While a large body of results and algorithms exists, there are still many tantalizing important open problems including: 1) What can be said when the constraints are non-convex? 2) What happens if there is no solution (e.g., due to measurement errors)? 3) Can these methods be modified to work for more general optimization problems? 4) What happens if we apply projections that are based on non-Euclidean distances? I shall use modern tools from Convex Analysis, Monotone Operator Theory and Variational Analysis to advance the knowledge of projection methods and to make progress on the four open problem listed above. The skills my students and postdoctoral fellows will acquire will prepare them for successful careers in academia and industry which are critical to maintaining Canada's leadership in Science and Engineering.