Grant: Discovery Grants Program - Individual
Simon Fraser University
$17,000.00
Theory of cone programming and its applications
EF 2008-09
Résumé
In a cone programming problem, a linear function of variables is minimized subject to linear equality constraints on the variables and the essential constraint that the variables are in a closed convex cone. Cone programming, especially semidefinite program (SDP), problems arise in many applications in engineering, sciences, finance and statistics. Thus, it is of paramount importance to develop efficient and reliable algorithms to solve them.
This proposal aims at the development of the theory and implementation of algorithms for cone programs and also investigates the applications of cone programs. The objectives of this proposal consist of: 1) developing high-performance polynomially and superlinearly convergent primal-dual interior-point (IP) methods for SDP and other cone programs; 2) developing second-order IP algorithms based on iterative linear solvers for SDP and more general cone programs; 3) developing new and/or improving existing algorithms and implementations for first-order smooth and non-smooth methods for SDP and more general cone programming problems; in particular, developing new primal-dual first-order methods for these problems; 4) exploring wide applications of cone programs in robust portfolio selection and statistical decision.
The anticipated impact of the proposed research is: 1) to provide new insight into the behavior of second-order primal-dual IP algorithms and first-order smooth and non-smooth methods for SDP and more general cone programs; 2) to develop and distribute efficient implementations that will enable practitioners to solve small- to large-scale SDP and more general cone programming problems arising in diverse applications; 3) to provide wide applications of cone programs for robust portfolio selection and statistical decision, and to distribute efficient and user-friendly softwares for solving complex decision problems arising from these areas.
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
341410-2007
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
2008
Competition year année de concours
2007
Award amount
17000
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
20
Committee name en
Industrial Engineering
Committee name fr
Génie industriel
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
2
Nb partie
5
Application title
Theory of cone programming and its applications
Keyword
NA
Application summary
In a cone programming problem, a linear function of variables is minimized subject to linear equality constraints on the variables and the essential constraint that the variables are in a closed convex cone. Cone programming, especially semidefinite program (SDP), problems arise in many applications in engineering, sciences, finance and statistics. Thus, it is of paramount importance to develop efficient and reliable algorithms to solve them.
This proposal aims at the development of the theory and implementation of algorithms for cone programs and also investigates the applications of cone programs. The objectives of this proposal consist of: 1) developing high-performance polynomially and superlinearly convergent primal-dual interior-point (IP) methods for SDP and other cone programs; 2) developing second-order IP algorithms based on iterative linear solvers for SDP and more general cone programs; 3) developing new and/or improving existing algorithms and implementations for first-order smooth and non-smooth methods for SDP and more general cone programming problems; in particular, developing new primal-dual first-order methods for these problems; 4) exploring wide applications of cone programs in robust portfolio selection and statistical decision.
The anticipated impact of the proposed research is: 1) to provide new insight into the behavior of second-order primal-dual IP algorithms and first-order smooth and non-smooth methods for SDP and more general cone programs; 2) to develop and distribute efficient implementations that will enable practitioners to solve small- to large-scale SDP and more general cone programming problems arising in diverse applications; 3) to provide wide applications of cone programs for robust portfolio selection and statistical decision, and to distribute efficient and user-friendly softwares for solving complex decision problems arising from these areas.