Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Simon Fraser University

$19,000.00

First-Order Methods for Large-Scale Optimization and Applications

FY 2014-15

Summary
Nowadays large-scale optimization problems frequently arise in engineering and sciences, especially in bioinformatics, data mining, machine learning, medical, image processing and statistics. Due to high dimensionality and dense data, they are often very challenging for second-order methods, namely, Newton-type methods as each iteration of the latter methods requires solving a typically dense linear system. It is thus of paramount importance to develop efficient first-order methods for finding low accuracy solutions.This proposal aims at developing efficient first-order methods for large-scale constrained optimization and monotone inclusion problems, and also exploring their applications. The objectives of this proposal consist of: 1) developing first-order methods for solving general convex programming and establishing their iteration complexity; 2) developing first-order methods for solving monotone inclusion problems where inexact or non-Lipschitz continuous operator is involved and/or subproblems are solved inexactly, and establishing their iteration complexity; 3) developing decomposition methods for solving monotone inclusion problem with sum of multiple maximal monotone operators and establishing their iteration complexity; 4) studying first-order line-search methods for solving general nonconvex optimization problems and establishing their iteration complexity; and 5) exploring applications of first-order methods in the aforementioned areas. The anticipated significance of the proposed work includes: 1) providing new insights into first-order methods and enhancing their efficiency and capability for solving much broader convex and nonconvex optimization problems; 2) developing efficient first-order methods for solving the monotone inclusion problems, which will provide powerful tools for solving general saddle point, equilibrium, variational inequality and optimization problems; and 3) developing efficient software of first-order methods for various applications.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
341410-2012
Name nom
Lu, Zhaosong
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2012
Award amount
19000
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
1206
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Engineering
Area of application fr
Génie
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
3
Nb partie
5
Application title
First-Order Methods for Large-Scale Optimization and Applications
Keyword
NSERC
Application summary
Nowadays large-scale optimization problems frequently arise in engineering and sciences, especially in bioinformatics, data mining, machine learning, medical, image processing and statistics. Due to high dimensionality and dense data, they are often very challenging for second-order methods, namely, Newton-type methods as each iteration of the latter methods requires solving a typically dense linear system. It is thus of paramount importance to develop efficient first-order methods for finding low accuracy solutions.This proposal aims at developing efficient first-order methods for large-scale constrained optimization and monotone inclusion problems, and also exploring their applications. The objectives of this proposal consist of: 1) developing first-order methods for solving general convex programming and establishing their iteration complexity; 2) developing first-order methods for solving monotone inclusion problems where inexact or non-Lipschitz continuous operator is involved and/or subproblems are solved inexactly, and establishing their iteration complexity; 3) developing decomposition methods for solving monotone inclusion problem with sum of multiple maximal monotone operators and establishing their iteration complexity; 4) studying first-order line-search methods for solving general nonconvex optimization problems and establishing their iteration complexity; and 5) exploring applications of first-order methods in the aforementioned areas. The anticipated significance of the proposed work includes: 1) providing new insights into first-order methods and enhancing their efficiency and capability for solving much broader convex and nonconvex optimization problems; 2) developing efficient first-order methods for solving the monotone inclusion problems, which will provide powerful tools for solving general saddle point, equilibrium, variational inequality and optimization problems; and 3) developing efficient software of first-order methods for various applications.