未找到相关数据
Newton method for solving a class of smooth convex programming
被引：0
作者：
Yi-rong Yao
Lian-sheng Zhang
Bo-shun Han
机构：
[1] Shanghai University,Department of Mathematics
来源：
Applied Mathematics and Mechanics
|
2005年
/
26卷
关键词：
convex programming;
Newton method;
KKT multiplier;
O221.2;
A;
90C25;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：1491 / 1498
页数：7
相关论文