NEWTON METHOD FOR SOLVING A CLASS OF SMOOTH CONVEX PROGRAMMING  

作　　者：姚奕荣 张连生 韩伯顺 DAI Shi-qiang 

机构地区：[1]Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China [2]不详

出　　处：《Applied Mathematics and Mechanics(English Edition)》2005年第11期1491-1498,共8页应用数学和力学（英文版）

基　　金：ProjectsupportedbytheNationalNaturalScienceFoundationofChina(No.10271073)

摘　　要：An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.

关 键 词：convex programming Newton method KKT multiplier 

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