课题基金 / 基金详情

CCF AF:EAGER:ASSESSING PRACTICALITY OF A NEW FRAMEWORK FOR SOLVING CONIC OPTIMIZATION PROBLEMS BY FIRST-ORDER METHODS

CCF AF:EAGER:ASSESSING PRACTICALITY OF A NEW FRAMEWORK FOR SOLVING CONIC OPTIMIZATION PROBLEMS BY FIRST-ORDER METHODS
CCF AF:Eager:评估通过一阶方法解决圆锥优化问题的新框架的实用性
批准号:
1552518
负责人:
James Renegar
金额:
$10.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2015
资助国家:
美国
项目状态:
已结题
起止时间:
2015-09-01 至 2018-02-28

项目摘要

项目成果

James Renegar的其他基金

相似基金

相关文献

中文摘要
翻译
分析学是将数据转化为更好决策的科学过程,它的一个关键组成部分是优化,即产生满足给定约束的最佳解决方案,即使选定的“目标”函数最大化的解决方案。目标和约束共同构成“优化模型”。求解模型的难度取决于目标函数和约束函数的类型,以及函数中变量的数量。由于庞大、复杂的现实世界模型可能有许多变量,所需的计算机内存数量成为经典算法解决问题的瓶颈。现代算法通过计算更少必须存储在内存中的结构来避免这一瓶颈。例如,一些现代算法只计算函数的一阶导数,而旧算法也在内存中存储二阶导数。这些现代算法被称为“一阶方法”(大致意思是“只使用一阶导数的算法”)。一阶方法可以处理复杂的目标函数,但如何处理复杂的约束函数一直是未知的。该项目的重点是一个新的框架,它允许许多具有复杂约束的优化模型轻松转换为仅具有简单约束的等效模型,从而可以应用现有的一阶方法。该项目的目标是彻底测试,使用新框架,以前无法解决的重要大型模型现在是否可以常规解决。如果是这样,依赖于Analytics的实体可能会受益,因为它们包含复杂约束的庞大模型实际上可能会通过现有的一阶方法得到解决。新的框架将任何凸、二次优化问题转化为一个等价的优化问题,其唯一的约束条件是线性方程,比原问题多一个方程。实际上,任何次梯度法都可以应用于等效问题。此外,对于一类广泛的二次优化问题(双曲规划),等效问题的目标函数可以被“平滑”,从而允许加速梯度方法的应用。该项目的目标是彻底测试应用一阶方法解决大型、一般、二次优化问题的新方法的实用性。博士生将与学术界和工业界的优化专家协商,测试该框架,作为其职业发展的一部分。其结果应该是,企业、政府、医疗保健和教育部门能够更好地分析数据,以便根据数据做出决策。
英文摘要
A key component of Analytics, the scientific process of transforming data into insight for better decisions, is Optimization, which produces the best solution satisfying given constraints -- the solution that maximizes a chosen "objective" function. The objective and constraints together form "an optimization model." The difficulty of solving a model depends on the types of objective and constraint functions, and on the number of variables in the functions. Since huge, complicated, real-world models can have many variables, the amount of computer memory needed becomes the bottleneck for solutions by classical algorithms. Modern algorithms avoid this bottleneck by calculating fewer structures that have to be stored in memory. For example, some modern algorithms evaluate only first derivatives of functions, whereas older algorithms also stored second derivatives in memory. These modern algorithms are known as "first-order methods" (meaning, roughly, "algorithms using only first derivatives"). First-order methods can handle complicated objective functions, but it has been unknown how to handle complicated constraint functions. The focus of the project is a new framework that allows many optimization models with complicated constraints to be easily transformed into equivalent models with only simple constraints, so that existing first-order methods can be applied. The goal of the project is to thoroughly test whether, using the new framework, important huge models that were previously unsolvable can now be solved routinely. If so, entities relying on Analytics could benefit, in that their huge models involving complicated constraints might actually become solvable by existing first-order methods. The new framework transforms any convex, conic optimization problem into an equivalent optimization problem whose only constraints are linear equations, one more equation than for the original problem. Virtually any subgradient method can be applied to the equivalent problem. Moreover, for a wide class of conic optimization problems (hyperbolic programs), the objective function for the equivalent problem can be "smoothed," thus allowing for application of accelerated gradient methods. The goal of the project is to thoroughly test practicality of the new approach in applying first-order methods to solve large, general, conic optimization problems. PhD students will test this framework as part of their careers formation, in consultation with optimization experts from both academia and industry. The result should be better analytics in business, government, healthcare and education for making decisions based on data.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Design of Gradient-Based Methods for Solving General and Huge Convex Optimization Problems
  • 批准号:
    1812904
  • 项目类别:
    Standard Grant
  • 资助金额:
    $31.68万
  • 财政年份:
    2018
  • 负责人:
    James Renegar
  • 依托单位:
Shrinkwrapping Linear Programs
  • 批准号:
    0430672
  • 项目类别:
    Standard Grant
  • 资助金额:
    $18.05万
  • 财政年份:
    2004
  • 负责人:
    James Renegar
  • 依托单位:
A Deeper Understanding of the Geometry of Interior-Point Methods
  • 批准号:
    9901941
  • 项目类别:
    Standard Grant
  • 资助金额:
    $19.84万
  • 财政年份:
    1999
  • 负责人:
    James Renegar
  • 依托单位:
Issues Relating Linear Programming, Complexity Theory and Numeric Computation
  • 批准号:
    9403580
  • 项目类别:
    Standard Grant
  • 资助金额:
    $12.21万
  • 财政年份:
    1995
  • 负责人:
    James Renegar
  • 依托单位:
国内基金
海外基金
基于前瞻性队列的双酚AF联合果糖加重代谢损伤的靶向代谢组学研究
  • 批准号:
    2025JJ30049
  • 项目类别:
    省市级项目
  • 资助金额:
    --
  • 批准年份:
    2025
  • 负责人:
    王穆
  • 依托单位:
U2AF2-circMMP1信号轴促进结直肠癌进展的分子机制研究
U2AF2精氯酸甲基化调控RNA转录合成在MTAP缺失骨肉瘤T细胞耗竭中的机制研究
  • 批准号:
    --
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    --
  • 批准年份:
    2024
  • 负责人:
    穆浩然
  • 依托单位:
BDA-366通过MYD88/NF-κB/PGC1β通路杀伤 KMT2A/AF9 AML细胞的机制研究
  • 批准号:
  • 项目类别:
    省市级项目
  • 资助金额:
    15.0万元
  • 批准年份:
    2024
  • 负责人:
    吴利新
  • 依托单位: