Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

École Polytechnique de Montréal

$24,000.00

Development, analysis and application of optimization methods for engineering problems

FY 2014-15

Summary
The research described in this proposal is partitioned into two complementary fields of optimization.Direct search algorithms are designed to solve black-box optimization problems. The term black-box signifies that the structure of the functions describing the problem cannot be exploited. This is the case for example, when evaluating a function requires running a lab experiment, or involves running proprietary codes to solve subproblems. The output of these codes are often of limited precision, contaminated with noise, expensive to evaluate, and sometimes the code fails to return a function value. These direct search algorithms are often useful when other classical optimization methods fail to function. Several real optimization problems are of this type. Direct search methods are a tool that can help solve some of them.These method were or will be applied to planform design in aeronautic, to tsunami detection buoy placement, to snow sensor positioning in hydrology, to optimal take-off trajectories, to spent potliner treatment in aluminium production, as well as surgery planing in pediatric cardiology.Contrary to black-box optimization, non-convex global optimization requires that the target problem possess a known structure, and in addition, that structure must be exploitable. To devise efficient global optimization algorithm, one must exploit as much as possible the structure. We will also study the links that tie various optimization classes in order to transfer, extend end develop the theory and algorithms.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
239436-2010
Name nom
Audet, Charles
Department département
Mathématiques et génie industriel
Organization id
64
Institution établissement
École Polytechnique de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2010
Award amount
24000
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
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
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
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Partie
5
Nb partie
5
Application title
Development, analysis and application of optimization methods for engineering problems
Keyword
NSERC
Application summary
The research described in this proposal is partitioned into two complementary fields of optimization.Direct search algorithms are designed to solve black-box optimization problems. The term black-box signifies that the structure of the functions describing the problem cannot be exploited. This is the case for example, when evaluating a function requires running a lab experiment, or involves running proprietary codes to solve subproblems. The output of these codes are often of limited precision, contaminated with noise, expensive to evaluate, and sometimes the code fails to return a function value. These direct search algorithms are often useful when other classical optimization methods fail to function. Several real optimization problems are of this type. Direct search methods are a tool that can help solve some of them.These method were or will be applied to planform design in aeronautic, to tsunami detection buoy placement, to snow sensor positioning in hydrology, to optimal take-off trajectories, to spent potliner treatment in aluminium production, as well as surgery planing in pediatric cardiology.Contrary to black-box optimization, non-convex global optimization requires that the target problem possess a known structure, and in addition, that structure must be exploitable. To devise efficient global optimization algorithm, one must exploit as much as possible the structure. We will also study the links that tie various optimization classes in order to transfer, extend end develop the theory and algorithms.