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

A SQP METHOD FOR MINIMIZING A CLASS OF NONSMOOTH FUNCTIONS
引用本文:孙小玲,张连生,白延琴. A SQP METHOD FOR MINIMIZING A CLASS OF NONSMOOTH FUNCTIONS[J]. 高等学校计算数学学报(英文版), 1996, 0(2)
作者姓名:孙小玲  张连生  白延琴
作者单位:Department of Mathematics,Shanghai University,Shanghai Jiading,Shanhai 201800,PRC.,Department of Mathematics,Shanghai university,Shanghai Jiading,Shanhai 201800,PRC.,Department of Mathematics,Shanghai University,Shanghai Jiading,Shanhai 201800,PRC.
摘    要:In this paper,we present a successive quadratic programming(SQP)method for minimizing a class of nonsmooth functions,which are the sum of a convex function and a nonsmooth composite function.The method generates new iterations by using the Armijo-type line search technique after having found the search directions.Global convergence property is established under mild assumptions.Numerical results are also offered.


A SQP METHOD FOR MINIMIZING A CLASS OF NONSMOOTH FUNCTIONS
Sun Xiao-ling. A SQP METHOD FOR MINIMIZING A CLASS OF NONSMOOTH FUNCTIONS[J]. Numerical Mathematics A Journal of Chinese Universities English Series, 1996, 0(2)
Authors:Sun Xiao-ling
Affiliation:Sun Xiao-ling Department of Mathematics,Shanghai University,Shanghai Jiading,Shanhai 201800,PRC. Zhang Lian-sheng Department of Mathematics,Shanghai university,Shanghai Jiading,Shanhai 201800,PRC. Bai Yan-qin Department of Mathematics,Shanghai University,Shanghai Jiading,Shanhai 201800,PRC.
Abstract:In this paper,we present a successive quadratic programming(SQP)method for minimizing a class of nonsmooth functions,which are the sum of a convex function and a nonsmooth composite function.The method generates new iterations by using the Armijo-type line search technique after having found the search directions.Global convergence property is established under mild assumptions.Numerical results are also offered.
Keywords:Nonsmooth optimization  SQP method  global convergence.
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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