西安电子科技大学学报（自然科学版）2016，Vol.43Issue(5)：88-92,182,6.DOI:10.3969/j.issn.1001-2400.2016.05.016
极小极大问题的生物地理学优化邻近点算法
Biogeography based optimization-proximal point algorithm for nonlinear minimax problems
摘要
Abstract
Concerning the discrete nonlinear minimax problems with the convex function as each of its components , a new method , called the biogeography based optimization‐proximal point algorithm , is presented . By using maximum‐entropy methods , the minimax problem is transformed into the unconstrained optimization problem of the smooth function . The algorithm employs the proximal point algorithm as the outer algorithm , and the biogeography based optimization as the internal algorithm . The proposed algorithm which resolves several minimax problems is global convergent . Preliminary numerical experiments show that the proposed algorithm is an effective algorithm for nonlinear minimax problems .关键词
生物地理学优化/进化算法/极小极大问题/邻近点算法Key words
biogeography based optimization/evolutionary computation/minimax problems/proximal point algorithm分类
数理科学引用本文复制引用
杨国平,刘三阳,张建科..极小极大问题的生物地理学优化邻近点算法[J].西安电子科技大学学报（自然科学版）,2016,43(5):88-92,182,6.基金项目
国家自然科学基金资助项目（61373174，71271165）；陕西省教育厅自然科学专项基金资助项目（2013JK1130，11JK1051）；中央高校基本科研业务费专项资金资助项目 （）
