U.S.-Japan Cooperative Science: Algorithms for Linear Programs Over Symmetric Cones

美日合作科学：对称锥上的线性规划算法

• 批准号: 9910084
• 负责人: Renato D. C. Monteiro
• 金额: $ 2.28万
• 依托单位: Georgia Tech Research Corporation
• 依托单位国家: 美国
• 项目类别: Standard Grant
• 财政年份: 2000
• 资助国家: 美国
• 起止时间: 2000-07-15 至 2004-06-30
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=9910084&HistoricalAwards=false
• 关键词: U.S.; Japan; Cooperative; Science; Algorithms

9910084MonteiroThis award supports a three-year collaborative research project between Professor Renato Monteiro of the Georgia Institute of Technology and Professor Takashi Tsuchiya at the Institute of Statistical Mathematics in Tokyo, Japan. The researchers will be undertaking a study of algorithms for linear programs over symmetric cones. Since large-scale semidefinite programming (SDP) problems arise in many applications in continuous optimization, matrix analysis, engineering, statistics and discrete/combinatorial optimization, it is of paramount importance to develop fast and reliable algorithms to solve them. The goal of the proposed research is to provide new insight into the behavior of primal-dual interior-point algorithms and to develop novel computational tools that will enable practitioners to solve large-scale SDP problems. The researchers will investigate nonlinear-programming-type algorithms for solving large-scale specially structured SDP problems. They will also be researching new methodologies to enhance the computational performance of interior-point methods towards solving large-scale SDP problems. Finally they plan to develop and implement efficient interior-point methods for solving nonlinear SDP problems. The project brings together the efforts of two laboratories that have complementary expertise and research capabilities. This research project has excellent potential to have a strong impact on the growing literature about (SDP) problems and on the development of efficient methods to solve them. It will also lead to new or improved algorithms to find exact or approximate solutions to large-scale optimization problems arising in diverse applications in industry, finance science, and engineering. The project advances international human resources through the participation of a graduate student. Through the exchange of ideas and technology, this project will broaden our base of basic knowledge and promote international understanding and cooperation. Results of the research will be published in international scientific journals and also presented at scientific meetings in the U.S. and abroad.

9910084蒙泰罗该奖项支持一个为期三年的合作研究项目之间的雷纳托蒙泰罗教授的格鲁吉亚技术研究所和土屋隆教授在统计数学研究所在日本东京。 研究人员将进行对称锥上线性规划算法的研究。 由于大规模半定规划（SDP）问题在连续优化、矩阵分析、工程、统计和离散/组合优化等领域的许多应用中都有出现，因此开发快速、可靠的算法来求解这些问题是至关重要的。 拟议的研究的目标是提供新的洞察原始对偶相邻点算法的行为，并开发新的计算工具，使从业者能够解决大规模的SDP问题。 研究人员将研究解决大规模特殊结构SDP问题的非线性编程型算法。 他们还将研究新的方法，以提高解决大规模SDP问题的邻域点方法的计算性能。 最后，他们计划开发和实施有效的边界点方法来解决非线性SDP问题。 该项目汇集了两个具有互补专业知识和研究能力的实验室的努力。该研究项目具有很好的潜力，对（SDP）问题的不断增长的文献和解决这些问题的有效方法的发展产生强烈的影响。 它还将导致新的或改进的算法，以找到精确或近似的解决方案，在工业，金融科学和工程的各种应用中出现的大规模优化问题。 该项目通过一名研究生的参与促进国际人力资源。 通过交流思想和技术，该项目将扩大我们的基础知识，促进国际理解与合作。 研究结果将发表在国际科学期刊上，并在美国和国外的科学会议上发表。