Global Optimality Conditions and Near-Perfect Optimization in Coding

摘要：

Finding ways of recognizing global optimum is the very fundamental, unsolved problem in existing optimization theories. We can not establish a true theory of optimization without it. Also, it is very hard to construct effective algorithms for finding global optimum. This paper presented a new optimization principle, called cooperative optimization, for solving this extremely important problem in optimization theory. A number of global optimality conditions are provided in a general form. The application of cooperative optimization in coding yields near-perfect results in finding global optima, significantly better than the most powerful optimization algorithm ever found so far.

作者: Xiaofei Huang

作者单位: School of Information Science and Technology Tsinghua University, Beijing, P.R. China, 100084

会议类型: 国际会议

会议名称: The 11th Annual International Computing and Combinatorics Conference COCOON 2005(第11届国际计算和组合会议)

会议地点: 昆明

会议语种:英文

页码: 915-924

在线出版日期: 2005-08-01（万方平台首次上网日期，不代表论文的发表时间）