Parallel Reliable Global Optimization with Interval Arithmetic

使用区间算法的并行可靠全局优化

• 批准号: 0202042
• 负责人: Chenyi Hu
• 金额: $ 9.81万
• 依托单位: University of Central Arkansas
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2002
• 资助国家: 美国
• 起止时间: 2002-10-01 至 2006-09-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=0202042&HistoricalAwards=false
• 关键词: Parallel; Reliable; Global; Optimization; Interval

In this proposed RUI research, we will apply our current research results supported by NSFto design efficient parallel algorithms and to develop software to reliable numerical solutionsfor both unconstrained and constrained multivariate global nonlinear optimization problems.To achieve high reliability, even in the presence of uncertainty in the data, roundo error, andnonlinearities by finite digit computations, we apply interval arithmetic in this project. The basicalgorithms to be used are interval branch-and-bound method and interval Newton/generalizedbisection method.In designing parallel algorithm and developing portable software, we will take full advantagesof parallel computing to significantly reduce not only elapsed computation time but also totalamount of computation due to the spatial nature of the problem we address. To achieve high efficiency,we will balance workload dynamically among available processors through inter-processorcommunication. The software will be architecture independent. General sparsity and scalabilitywill be considered as well. The research results, parallel software package, installation and userguides, and testing examples will be freely disseminated through the Internet.

在RUI的研究中，我们将利用NSF支持的现有研究成果，设计高效的并行算法，并开发软件来可靠地求解无约束和有约束的多变量全局非线性优化问题。为了实现高可靠性，即使在数据存在不确定性，舍入误差和有限位计算的非线性的情况下，我们在这个项目中应用区间算法。所使用的基本算法是区间分支定界法和区间牛顿/广义二分法，在设计并行算法和开发可移植软件时，我们将采取充分的并行计算，不仅大大减少了计算时间，而且由于我们解决的问题的空间性质，总的计算量。为了达到高效率，我们将通过处理器间的通信在可用的处理器之间动态地平衡工作负载。该软件将独立于体系结构。一般稀疏性和可扩展性也将被考虑。研究结果、并行软件包、安装和用户指南以及测试示例将通过互联网免费传播。