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

9725220波拉克 这是Elijah Polak和他的学生Ismail S.加州大学伯克利分校的Khalil Bustany，澳大利亚悉尼新南威尔士大学的Liqun Qi和Robert Wormseley以及他们的学生，来自中国的Zenxin Wei和来自越南的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.