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

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

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.