摘要
对于目标函数为凸的一类非凸规划,证明了其K-K-T点一定是局部极小点。在求解此类非凸规划时,基于可行域满足较法锥条件更弱的拟法锥、弱拟法锥等条件下,同伦方法得到的K-K-T点一定是局部极小点。对于一般非凸规划问题,证明了边界上的K-K-T点如果不是驻点,则一定是局部极小点。
It is proved that, the K-K-T point of a class of nonconvex programming problem, objective function of which is convex, is a local minimum. For this nonconvex programming problem under the quasi-normal cone condition or the weak quasi-normal cone condition, which are weaker than normal,cone condition the K-K-T point got by homotopy method must be a lo- cal minimum.It is also proved that,for general nonconvex programming problem,if the K-K-T point on the boundary is not a stationary point,it must be a local minimum.
作者
孙文娟
申爱红
刘芳
SUN Wenjuan SHEN Aihong LIU Fang(Shenyang Ligong University, S henyang 110159,China Foundation department, National Police University of China, Shenyang 110854, China)
出处
《沈阳理工大学学报》
CAS
2017年第4期102-104,共3页
Journal of Shenyang Ligong University
基金
辽宁省教育厅科学技术研究项目(LG201615)