Grant: Discovery Grants Program - Individual
University of British Columbia
$43,000.00
Structured Blackbox Optimization
EF 2022-23
Résumé
Optimization, the study of minimizing or maximizing a function, arises naturally in virtually every area of science. In some applications the use of optimization is obvious, such as minimizing the cost when designing a new road. In other applications the use of optimization is more subtle, such as denoising in medical imaging.In optimization, a blackbox is any function that is not analytically available. When evaluated at a point, a blackbox returns an objective function value. In addition, some blackboxes return a (sub)gradient vector. A blackbox optimization problem is any optimization problem where some, or all, of the functions defining the problem are given by blackboxes.One common occurrences of blackbox functions is the output of a computer simulation. Given some input parameters, the simulation executes and returns a function value. If the simulation is implemented in an open source language, then automated differentiation could be employed to further obtain a (sub-)gradient vector. As computer simulations have become ubiquitous in modern research, blackbox optimization represents one of the most important areas of research for solving future real-world applications.In some applications, the blackbox has some visible structure. A structured blackbox optimization problem is any optimization problem where some, or all, of the underlying functions are given by blackboxes, but the problem itself has some visible mathematical structure. A simple example of structured blackbox optimization is minimizing the `worst-case outcome'. In this case, each scenario is provided through a blackbox, and the final objective is to minimize the maximum of all the blackbox functions. This can be (and often has been) approached by considering the maximum of all the blackbox functions as a single blackbox function. However, if we recognize the structure of the max function, we can design algorithms that are faster and more accurate for this problem.My research focuses on structured blackbox optimization. My work includes the development of novel algorithms for structured blackbox optimization, the application of algorithms to solve real-world optimization problems, and the advancement of knowledge in the mathematics behind structured blackbox optimization.HQP interested in working in algorithm design will be trained in developing convergence analysis, implementing algorithms, and numerical testing of algorithms. HQP interested in working in optimization applications will be trained in determining the structures within optimization problems, considering methods to exploit this structure, and selecting the appropriate algorithm to solve problems while considering solution time and quality. HQP interested in working theoretical analysis will be trained in the broad field of optimization theory, including strong foundations in functional analysis and variational analysis.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2018-03865
Name nom
Hare, Warren
Department département
Okanagan - Mathematics, Statistics and Physics Unit - 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
2022
Competition year année de concours
2018
Award amount
43000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
1600
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Industrial engineering
Research subject fr
Génie industriel
Installment
inst:5
Partie
1
Nb partie
6
Application title
Structured Blackbox Optimization
Application summary
Optimization, the study of minimizing or maximizing a function, arises naturally in virtually every area of science. In some applications the use of optimization is obvious, such as minimizing the cost when designing a new road. In other applications the use of optimization is more subtle, such as denoising in medical imaging.In optimization, a blackbox is any function that is not analytically available. When evaluated at a point, a blackbox returns an objective function value. In addition, some blackboxes return a (sub)gradient vector. A blackbox optimization problem is any optimization problem where some, or all, of the functions defining the problem are given by blackboxes.One common occurrences of blackbox functions is the output of a computer simulation. Given some input parameters, the simulation executes and returns a function value. If the simulation is implemented in an open source language, then automated differentiation could be employed to further obtain a (sub-)gradient vector. As computer simulations have become ubiquitous in modern research, blackbox optimization represents one of the most important areas of research for solving future real-world applications.In some applications, the blackbox has some visible structure. A structured blackbox optimization problem is any optimization problem where some, or all, of the underlying functions are given by blackboxes, but the problem itself has some visible mathematical structure. A simple example of structured blackbox optimization is minimizing the `worst-case outcome'. In this case, each scenario is provided through a blackbox, and the final objective is to minimize the maximum of all the blackbox functions. This can be (and often has been) approached by considering the maximum of all the blackbox functions as a single blackbox function. However, if we recognize the structure of the max function, we can design algorithms that are faster and more accurate for this problem.My research focuses on structured blackbox optimization. My work includes the development of novel algorithms for structured blackbox optimization, the application of algorithms to solve real-world optimization problems, and the advancement of knowledge in the mathematics behind structured blackbox optimization.HQP interested in working in algorithm design will be trained in developing convergence analysis, implementing algorithms, and numerical testing of algorithms. HQP interested in working in optimization applications will be trained in determining the structures within optimization problems, considering methods to exploit this structure, and selecting the appropriate algorithm to solve problems while considering solution time and quality. HQP interested in working theoretical analysis will be trained in the broad field of optimization theory, including strong foundations in functional analysis and variational analysis.