用对角二次近似方法解凸分离问题  

Solving the Convex Separation Problems by Using Diagonal Quadratic Approximations

作　　者：士明军[1] 黎蕾[1] 

机构地区：[1]重庆师范大学数学学院,重庆400047

出　　处：《重庆工商大学学报（自然科学版）》2013年第2期1-4,共4页Journal of Chongqing Technology and Business University:Natural Science Edition

基　　金：国家自然科学基金(10971241)

摘　　要：利用一种新的对角二次近似凸化方法解非线性规划问题;对于含有不同变量并且含有等式和不等式约束的非线性规划问题进行了讨论,给出了问题的稳定条件和解的形式,最后给出了相应的算法.In this paper, we solve the nonlinear programming problems by using a new diagonal quadratic approximations convexification method . Some nonlinear programming problems with different variables and with equality and inequality constraints are discussed . The stability conditions and the solutions are given . Finally, the corresponding algorithm is presented.

关 键 词：对角二次近似 Falk对偶 凸分离问题 

分 类 号：O221[理学—运筹学与控制论]