课题基金 / 基金详情

CAREER: Linear Matrix Inequality Representations in Optimization

CAREER: Linear Matrix Inequality Representations in Optimization
职业:优化中的线性矩阵不等式表示
批准号:
0844775
负责人:
Jiawang Nie
金额:
$50.04万
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2009
资助国家:
美国
项目状态:
已结题
起止时间:
2009-09-01 至 2015-08-31

项目摘要

项目成果

Jiawang Nie的其他基金

相似基金

相关文献

中文摘要
翻译
点击翻译按钮获取中文摘要
英文摘要
This proposal investigates the linear matrix inequality representations of convex sets and their applications in optimization problems. The work involves different kinds of mathematical tools like algebraic geometry, convex analysis, differential geometry, numerical analysis, optimization theory, and real algebra. The investigator not only studies the fundamental mathematics on the scope and depth of linear matrix inequality representability, but also work on designing new algorithms and software solving hard optimization problems.The following five main topics will be focused in this project: linear matrix inequality representations of rigid convex sets, semidefinite programming representations of convex semialgebraic sets, second order cone programming representations of convex semialgebraic sets, semidefinite programming representations of nonnegative multivariate polynomials, and linear matrix inequality methods for solving nonconvex optimization problems and polynomial systems. A basic problem of science and engineering is finding a global minimum of a function of many variables. As a metaphor one might think of a complicated terrain of mountains and valleys which stretches for hundreds of miles and one must find the lowest point in the lowest valley. The difficulty is that one can not see the map and one only knows a mathematical formula for the terrain and in most applications (like electronics, networks, biochemistry) there are many variables instead of three. Many algorithms will find the lowest point of a particular valley but none are known which effectively find the lowest valley itself. This NSF research is to develop global optimization algorithms for various situations. One is the class of problems where the data is given by polynomials. Another is to determine and parameterize convex problems very efficiently; in convex situations one has only one valley. These pursuits require integration of techniques from numerical mathematics, real and complex algebraic geometry, convex analysis, differential geometry, numerical analysis, and optimization theory, a wide range of mathematics. Jiawang Nie has personal experience with several areas of applications including sensor networks and systems control and this informs his mathematics and techniques. Other important features of this proposal are integrating research and education, developing new mathematical courses, training undergraduate and graduate students on using the latest mathematical tools, advising postdoctoral scholars on how to create novel research results.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Lagrange Multiplier Expression Methods for Optimization
  • 批准号:
    2110780
  • 项目类别:
    Standard Grant
  • 资助金额:
    $35.0万
  • 财政年份:
    2021
  • 负责人:
    Jiawang Nie
  • 依托单位:
Computational Methods for Symmetric Tensor Problems
  • 批准号:
    1619973
  • 项目类别:
    Standard Grant
  • 资助金额:
    $15.0万
  • 财政年份:
    2016
  • 负责人:
    Jiawang Nie
  • 依托单位:
Semidefinite Programming Methods for Moment and Optimization Problems
  • 批准号:
    1417985
  • 项目类别:
    Standard Grant
  • 资助金额:
    $21.0万
  • 财政年份:
    2014
  • 负责人:
    Jiawang Nie
  • 依托单位:
国内基金
海外基金
Development of a Linear Stochastic Model for Wind Field Reconstruction from Limited Measurement Data
  • 批准号:
    --
  • 项目类别:
    --
  • 资助金额:
    40万元
  • 批准年份:
    2020
  • 负责人:
    Vikrant Gupta
  • 依托单位: