CAREER: Linear Matrix Inequality Representations in Optimization

职业：优化中的线性矩阵不等式表示

• 批准号: 0844775
• 负责人: Jiawang Nie
• 金额: $ 50.04万
• 依托单位: University of California-San Diego
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2009
• 资助国家: 美国
• 起止时间: 2009-09-01 至 2015-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0844775&HistoricalAwards=false
• 关键词: CAREER; Linear; Matrix; Inequality; Representations

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.

本文研究了凸集的线性矩阵不等式表示及其在优化问题中的应用。这项工作涉及不同种类的数学工具，如代数几何，凸分析，微分几何，数值分析，优化理论，和真实的代数。研究者不仅研究线性矩阵不等式表示的广度和深度的基础数学，而且还致力于设计新的算法和软件来解决困难的优化问题。本项目将重点关注以下五个主要主题：刚性凸集的线性矩阵不等式表示，凸半代数集的半定规划表示，凸半代数集的二阶锥规划表示，非负多元多项式的半定规划表示，以及求解非凸优化问题和多项式系统的线性矩阵不等式方法。 求多元函数的全局极小值是科学与工程中的一个基本问题。作为一个比喻，人们可能会想到一个由山脉和山谷组成的复杂地形，绵延数百英里，人们必须在最低的山谷中找到最低点。困难的是，一个人看不到地图，一个人只知道地形的数学公式，在大多数应用中（如电子，网络，生物化学）有很多变量，而不是三个。许多算法将找到特定谷的最低点，但没有已知的有效地找到最低谷本身。NSF的这项研究旨在为各种情况开发全局优化算法。一类是数据由多项式给出的问题。另一个是非常有效地确定和参数化凸问题;在凸的情况下，只有一个谷。这些追求需要从数值数学，真实的和复杂的代数几何，凸分析，微分几何，数值分析和优化理论，广泛的数学技术的集成。Nie Jiawang Nie在传感器网络和系统控制等多个应用领域拥有个人经验，这为他的数学和技术提供了基础。该提案的其他重要特征包括整合研究与教育、开发新的数学课程、培训本科生和研究生使用最新的数学工具、为博士后学者如何创造新颖的研究成果提供建议。