课题基金 / 基金详情

Process Optimization Without an Algebraic Model

Process Optimization Without an Algebraic Model
无需代数模型的流程优化
批准号:
1033661
负责人:
Nikolaos Sahinidis
金额:
$36.41万
依托单位:
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2010
资助国家:
美国
项目状态:
已结题
起止时间:
2010-09-01 至 2013-08-31

项目摘要

项目成果

Nikolaos Sahinidis的其他基金

相似基金

相关文献

中文摘要
翻译
1033661 Sahinids优化领域是过程系统工程界的一个强烈关注焦点。因此,人们为代数非线性规划(NLP)和混合整数非线性规划(MINLP)开发了大量的模型、算法和软件。这些技术已经并将继续对工艺合成、设计和操作产生影响。然而,代数NLP/MINLP范式:o通常需要建模者做出限制性假设,以便使用当前的优化软件来求解他们的模型;o当必须通过专有软件进行昂贵的仿真来对复杂系统进行建模时,o效率低下;ANDO与工程实践不符,在工程实践中,技术发展几乎总是基于实验测量而不是代数模型。尤其是,实验提供了待优化目标函数的测量,但没有关于导数的直接信息或代数NLP/MINLP优化所需的任何其他信息。该项目旨在开发无需显式代数模型即可进行优化的优化算法和软件。为实现这一目标,PS计划:o完成对这一问题的现有方法的关键比较,特别是关于它们寻找全局解和改进起点的能力;o为由代数、模拟和实验组件的任意组合描述的系统开发新的局部和全局优化算法;o使用先前开发的算法来优化涉及多尺度、隐藏约束和噪声目标函数的系统;开发和提供依赖于现代网络基础结构的创新软件,并实施本研究中开发的算法。该项目将为新一代优化算法和软件奠定基础,这些算法和软件能够解决代数NLP和MINLP无法解决的复杂问题。在所有依靠模拟或实验进行设计和优化的科学领域,这样的问题比比皆是。一般而言,优化代数NLP和MINLP的任务是一项非常具有挑战性的任务。在没有显式代数模型的情况下进行优化可能会更具挑战性。这项研究通过利用代数NLP和MINLP的全局优化的最新进展来应对这一挑战,以开发新的、更有效的无代数模型优化的算法。广泛的影响该项目涉及研究生指导、将研究结果整合到课程工作中、有针对性地招募少数族裔学生,以及通过实施研究结果的创新的网络使能软件广泛传播结果。此外,这项研究将对工业实践产生直接和广泛的影响,因为它专门为基于实验的优化和设计提供了算法。
英文摘要
1033661SahinidisThe area of optimization is a strong focus of the process systems engineering community. As a result, a plethora of models, algorithms, and software have been developed for algebraic nonlinear programs (NLPs) and mixed-integer nonlinear programs (MINLPs). These techniques have had and will continue to have an impact in process synthesis, design, and operations. Yet, the algebraic NLP/MINLP paradigm:o often requires modelers to make restrictive assumptions in order to make possible the solution of their models with current optimization software;o is inefficient when expensive simulations must be carried out for modeling complex systems via proprietary software; ando is not in line with engineering practice, where technological developments are almost always based on experimental measurements rather than algebraic models.Experiments, in particular, provide measurements of the objective function to be optimized but no direct information on derivatives or any other information required by algebraic NLP/MINLP optimization. This project aims to develop optimization algorithms and software capable of optimizing without an explicit algebraic model. Towards this goal, the PS plans to:o complete a critical comparison of existing methods for this problem, especially in regard to their ability to find global solutions and improve starting points;o develop novel local and global optimization algorithms for optimizing systems described by any combination of algebraic, simulation, and experimental components;o use previously developed algorithms to optimize systems involving multiple scales, hidden constraints, and noisy objective functions;o develop and make available innovative software that relies on modern cyberinfrastruc-ture and implements the algorithms developed in this research.Intellectual Merit The project will lay the foundations of a new generation of optimization algorithms and software capable of solving complex problems for which algebraic NLPs and MINLPs are not available. Such problems abound in all scientific fields that rely on simulation or experiments for design and optimization. The task of optimizing algebraic NLPs and MINLPs is, in general, a very challenging one. Optimizing without explicit algebraic models can be even more challenging. This research addresses that challenge by capitalizing on recent progress in global optimization of algebraic NLPs and MINLPs to develop new, more efficient algorithms for algebraic-model-free optimization.Broader Impacts The project involves graduate student mentoring, integration of research results in course work, targeted minority student recruitment, and broad dissemination of the results through innovative cyber-enabled software implementing the results of the research. In addition, the research will have an immediate and wide impact on industrial practice as it specifically provides algorithms for experiment-based optimization and design.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
Novel Relaxations for Global Optimization
  • 批准号:
    1030168
  • 项目类别:
    Standard Grant
  • 资助金额:
    $20.0万
  • 财政年份:
    2010
  • 负责人:
    Nikolaos Sahinidis
  • 依托单位:
Development and Implementation of Algorithms for Stochastic Integer Programming
2001 TSE: NSF/EPA Partnership for Environmental Research: A Theoretical and Experimental Approach to Rapid Screening and Design of Secondary Refrigerants (TSE01-C)
Collaborative Research: Globally Optimal Neural Computing: Algorithms and Applications
国内基金
海外基金
Scalable Learning and Optimization: High-dimensional Models and Online Decision-Making Strategies for Big Data Analysis
供应链管理中的稳健型(Robust)策略分析和稳健型优化(Robust Optimization )方法研究
  • 批准号:
    70601028
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    7.0万元
  • 批准年份:
    2006
  • 负责人:
    王明征
  • 依托单位: