首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一类光滑凸规划的牛顿法
引用本文:姚奕荣,张连生,韩伯顺.一类光滑凸规划的牛顿法[J].应用数学和力学,2005,26(11):1351-1358.
作者姓名:姚奕荣  张连生  韩伯顺
作者单位:上海大学 数学系,上海 200444
基金项目:国家自然科学基金资助项目(10271073)
摘    要:给出了一个求解一类光滑凸规划的算法,利用光滑精确乘子罚函数把一个光滑凸规划的极小化问题化为一个紧集上强凸函数的极小化问题,然后在给定的紧集上用牛顿法对这个强凸函数进行极小化.

关 键 词:凸规划    牛顿法    KKT乘子
文章编号:1000-0887(2005)11-1351-08
收稿时间:02 1 2004 12:00AM
修稿时间:07 12 2005 12:00AM

Newton Method for Solving a Class of Smooth Convex Programming
YAO Yi-rong,ZHANG Lian-sheng,HAN Bo-shun.Newton Method for Solving a Class of Smooth Convex Programming[J].Applied Mathematics and Mechanics,2005,26(11):1351-1358.
Authors:YAO Yi-rong  ZHANG Lian-sheng  HAN Bo-shun
Institution:Department of Mathematics, Shanghai University, Shanghai 200444, P. R. China
Abstract: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 Newtonon method on the given compact set was minimized.
Keywords:convex programming  Newton method  KKT multiplier  
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《应用数学和力学》浏览原始摘要信息
点击此处可从《应用数学和力学》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号