摘要
把Ｔｈｅｉｌ和ＶａｎｄｅＰａｎｎｅ的二次规划算法推广到目标函数为严格伪凸的最优化问题，算法在解有限个规模较小的带等式约束子问题后可获得原问题的最优解。最后指出，该算法不能推广到更广的严格拟凸函数类。
The quadratic programming algorithm of Theil and Van de Panne is generalized to optimization problems whose objective function is strictly pseudoconvex.,An optimal solution of the originalproblem is obtained by solving a finite number of smaller sized subproblems.with equaliyconstrauis,Finally,it is sho wn that the algorithm could not be generalized to the more wiede dass of sdctly quasiconvex functions.
出处
《暨南大学学报（自然科学与医学版）》
CAS
CSCD
1994年第3期1-5,共5页
Journal of Jinan University(Natural Science & Medicine Edition)
基金
国家自然科学基金资助项目
关键词
非线性
二次规划
最佳化
nonlinear optiinization problem,quadratic programming
active constrait
strict-ly pseudoconvex function
strictly quasconvex function
