首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类具有连续变量的全局最优化问题的凸化方法
引用本文:李博,杜杰,万立娟.一类具有连续变量的全局最优化问题的凸化方法[J].数学杂志,2016,36(4):851-858.
作者姓名:李博  杜杰  万立娟
作者单位:青岛科技大学数理学院, 山东 青岛 266061,青岛科技大学数理学院, 山东 青岛 266061,青岛科技大学数理学院, 山东 青岛 266061
基金项目:山东省优秀中青年科学家科研奖励基金资助(BS2013SF014).
摘    要:本文研究了一类非凸最优化问题的凸化方法与最优性条件的问题.利用构造含有参数的函数变换方法,将具有次正定性质的目标函数凸化,并获得了这一类非凸优化问题全局最优解的充要条件,推广了凸化方法在求解全局最优化问题方面的应用.

关 键 词:全局优化  次正定函数  凸化  充要条件
收稿时间:2015/1/15 0:00:00
修稿时间:2015/5/6 0:00:00

CONVEXIFICATION APPROACHES FOR A CLASS OF CONTINUOUS GLOBAL OPTIMIZATION PROBLEM
LI Bo,DU Jie and WAN Li-juan.CONVEXIFICATION APPROACHES FOR A CLASS OF CONTINUOUS GLOBAL OPTIMIZATION PROBLEM[J].Journal of Mathematics,2016,36(4):851-858.
Authors:LI Bo  DU Jie and WAN Li-juan
Institution:School of Mathematics and Physics, Qingdao University of Science and Technology, Qingdao 266061, China,School of Mathematics and Physics, Qingdao University of Science and Technology, Qingdao 266061, China and School of Mathematics and Physics, Qingdao University of Science and Technology, Qingdao 266061, China
Abstract:In this paper, we develop convexification approaches and optimization criteria for a general class of nonconvex optimization problem. By using the method of function trans-formations with parameter, a class of novel convexification schems is presented for solving global optimization problem with positive sub-definite objective function. The general class of nonconvex programming discussed in the paper can be solved to global optimality, which extends applications of convexification schems in solving global optimization problems.
Keywords:global optimization  positive sub-definite function  convexification  necessary and sufficient condition
本文献已被 CNKI 等数据库收录!
点击此处可从《数学杂志》浏览原始摘要信息
点击此处可从《数学杂志》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号