Inverse problems, Robust Optimization and Mathematical Programs with Equilibrium Constraints: Algorithms and Applications
Inverse problems, Robust Optimization and Mathematical Programs with Equilibrium Constraints: Algorithms and Applications
批准号:
0606712
负责人:
Donald Goldfarb
金额:
$48.58万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2006
资助国家:
美国
项目状态:
已结题
起止时间:
2006-09-01 至 2010-08-31
中文摘要
该项目涉及建模和求解反问题、稳健优化问题和带平衡约束的数学规划(MPEC)的优化方法的研究和开发。逆问题的目标是确定观察到的或期望的结果的最可能的原因。这些问题出现在许多重要的军事、成像、信号处理、生物医学、遥感和地质应用中。反问题是不适定的,因为测量中的小误差可能会导致估计量的大误差。用来获得反问题稳定解的正则化技术产生了一般的非线性规划问题。在成像和信号处理等特殊情况下,逆问题可以重新表示为一个易于处理的凸规划问题。然而,在大多数情况下,例如形状优化,需要解决非凸优化问题。稳健优化是一种在优化环境中对不确定性进行建模和管理的方法。这里,人们关注的不是参数识别问题,而是约束优化问题,其中参数是数据,并且由于测量或估计误差,已知仅存在于有界不确定集内。在模糊机会约束(稳健)最优化中,假定参数是具有不确定分布的随机变量,该分布仅已知位于概率度量的不确定集合内。幸运的是,对于某些不确定集,只要问题的非稳健版本本身是凸的,稳健优化问题就会产生易于处理的凸规划问题。这些问题出现在工程设计、投资组合选择和服务网络设计等多个领域。MPEC植根于博弈论和双层优化。它们是最优化问题,其中一些约束是参数变分不等或互补系统,它们是由低级最优化问题的最优性条件产生的。对于一些重要的经济问题和最优工程设计问题,MPEC是一个很好的模型,其中的均衡约束来自于竞争力。因此,研究MPEC的可扩展求解算法具有重要的现实意义。一般来说,解决这三类中的任何一类的问题都是相当困难的,并且需要大量的计算资源。乍一看,这三种建模范例似乎截然不同。因此,在这三个领域发生的算法发展之间的互动很少。虽然所有的范式都有一个独特的结构和一组特殊的问题,但它们有许多共同之处。除了它们在形式上的分析相似性之外,根据上下文的不同,所有这三种范例通常用于对同一应用程序进行建模。该项目的一个目标是利用这些范例的共同特征来开发新的、更有效的解决方法。第二个目标是通过开发新的博士课程以及让学生参与理论研究和软件开发,提供反问题、稳健优化和MPEC方面的跨学科培训。
英文摘要
This project involves the study and development of optimization methods for modeling and solving inverse problems, robust optimization problems, and mathematical programs with equilibrium constraints (MPECs). The goal of inverse problems is to determine the most likely causes for an observed or desired effect. Such problems arise in a number of important military, imaging, signal processing, biomedical, remote-sensing, and geological applications. Inverse problems are ill-posed in the sense that a small error in measurement can lead to large errors in the estimated quantities. The regularization techniques used to obtain stable solutions to inverse problems give rise to general nonlinear programming problems. In special cases, such as imaging and signal processing, the inverse problem can be reformulated as a tractable convex programming problem. In most cases, e.g. shape optimization, however, a non-convex optimization problem needs to be solved. Robust optimization is an approach for modeling and managing uncertainty in an optimization context. Here, rather than solving a parameter identification problem, one is concerned with constrained optimization problems in which the parameters are data and, due to measurement or estimation errors, are only known to lie within bounded uncertainty sets. In ambiguous chance-constrained (robust) optimization it is assumed the parameters are random variables with an uncertain distribution that is only known to lie within an uncertainty set of probability measures. Fortunately, for certain classes of uncertainty sets, robust optimization problems give rise to tractable convex programming problems as long as the non-robust versions of the problems are themselves convex. These problems arise in areas as diverse as engineering design, portfolio selection, and the design of service networks. MPECs have their roots in game theory and bi-level optimization. They are optimization problems in which some of the constraints are parametric variational inequalities or complementarity systems that arise from the optimality conditions for a lower-level optimization problem. MPECs are a good model for a number of important economic problems, where the equilibrium constraints arise from competitive forces, and optimal engineering design problems. Consequently, developing scalable solution algorithms for MPECs is of considerable practical importance. In general, solving problems from any of these three classes is quite difficult and requires significant computational resources. At first glance, these three modeling paradigms appear quite distinct. Consequently, there has been very little interaction between the algorithmic developments that have occurred in these three areas. While all of the paradigms have a unique structure and a special set of issues, they have much in common. Besides their formal analytical similarity, depending on the context all three paradigms are often used to model the same application. A goal of this project is to leverage the common features of these paradigms to develop new and more efficient solution methods. A second goal is to provide interdisciplinary training in inverse problems, robust optimization, and MPECs through the development of new doctoral courses and involvement of students in theoretical research and software development.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
BIGDATA: F: Multiaffine Constrained Optimization for High-Dimensional Big Data Models
-
批准号:1838061
-
项目类别:Standard Grant
-
资助金额:$70.0万
-
财政年份:2018
-
负责人:Donald Goldfarb
-
依托单位:
Fast First-Order Methods for Large-Scale Structured and Sparse Optimization
-
批准号:1016571
-
项目类别:Standard Grant
-
资助金额:$45.0万
-
财政年份:2010
-
负责人:Donald Goldfarb
-
依托单位:
Second-order Cone Programming : Algorithms and Applications
-
批准号:0104282
-
项目类别:Continuing Grant
-
资助金额:$24.0万
-
财政年份:2001
-
负责人:Donald Goldfarb
-
依托单位:
Mathematical Sciences: Algorithms for Mathematical Programming
-
批准号:9414438
-
项目类别:Standard Grant
-
资助金额:$12.0万
-
财政年份:1995
-
负责人:Donald Goldfarb
-
依托单位:
Mathematical Sciences: Algorithms for Mathematical Programming
-
批准号:9106195
-
项目类别:Continuing Grant
-
资助金额:$12.0万
-
财政年份:1991
-
负责人:Donald Goldfarb
-
依托单位:
Mathematical Science: Algorithms for Network Flow Problems
-
批准号:8512277
-
项目类别:Continuing Grant
-
资助金额:$10.31万
-
财政年份:1986
-
负责人:Donald Goldfarb
-
依托单位:
Algorithms For Nonlinear Programming
-
批准号:8341408
-
项目类别:Standard Grant
-
资助金额:$7.51万
-
财政年份:1983
-
负责人:Donald Goldfarb
-
依托单位:
Algorithms For Nonlinear Programming
-
批准号:8006065
-
项目类别:Standard Grant
-
资助金额:$16.55万
-
财政年份:1980
-
负责人:Donald Goldfarb
-
依托单位:
国内基金
海外基金
复杂图像处理中的自由非连续问题及其水平集方法研究
-
批准号:60872130
-
项目类别:面上项目
-
资助金额:28.0万元
-
批准年份:2008
-
负责人:刘国才
-
依托单位: