US-Australia Cooperative Research Superlinearly Converging Minimax Algorithms for Engineering Design

美澳合作研究用于工程设计的超线性收敛极小极大算法

• 批准号: 9725220
• 负责人: Elijah Polak
• 金额: $ 4.28万
• 依托单位: University of California-Berkeley
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 1997
• 资助国家: 美国
• 起止时间: 1997-09-15 至 2000-08-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9725220&HistoricalAwards=false
• 关键词: US; Australia; Cooperative; Research; Superlinearly

9725220 Polak This is a collaborative research project between Elijah Polak and his student, Ismail S. Khalil Bustany, at the University of California, Berkeley, and Liqun Qi and Robert Wormseley and their students, Zenxin Wei from China and Quoc- Thong Le-Gia from Vietnam, at the University of New South Wales, Sydney, Australia, aimed at developing efficient superlinearly converging algorithms for the solution of minimax problems in engineering design. A large number of engineering design problems, such as design of wind and seismic resistant structures, electronic circuit centering, and robot motion planning, can be cast in the form of minimax problems. Because of their considerable economic importance, the construction of efficient algorithms is an important problem. This U.S.-Australia collaboration brings together the expertise in engineering optimization, semi- finite optimization, and local algorithm globalization available at Berkeley, with the expertise in the construction of superlinearly converging generalized Newton Type methods for nonsmooth optimization and numerical analysis available in Sydney.

9725220 Polak这是加州大学伯克利分校的Elijah Polak和他的学生Ismail S.Khalil Bustany，以及澳大利亚悉尼新南威尔士大学的齐立群和Robert Wormseley以及他们的学生，来自越南的中国和Quoc-Thong Le-Gia的合作研究项目，旨在开发高效的超线性收敛算法来解决工程设计中的极小极大问题。大量的工程设计问题，如抗风抗震结构设计、电子线路定心、机器人运动规划等，都可以归结为极小极大问题。由于它们具有相当大的经济重要性，因此构造高效的算法是一个重要的问题。这项美澳合作将伯克利的工程优化、半有限优化和局部算法全球化方面的专业知识与悉尼的超线性收敛的非光滑优化和数值分析的广义牛顿型方法的专业知识结合在一起。