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

NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION
作者姓名:徐慧福
作者单位:Department of
摘    要:A kind of nondecreasing subgradient algorithm with appropriate stopping rule has been proposed for nonsmooth constrained minimization problem. The dual theory is invoked in dealing with the stopping rule and general global minimiizing algorithm is employed as a subroutine of the algorithm. The method is expected to tackle a large class of nonsmooth constrained minimization problem.


NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION
Xu Hui-fu.NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION[J].Numerical Mathematics A Journal of Chinese Universities English Series,1994(2).
Authors:Xu Hui-fu
Institution:Xu Hui-fu Department of Mathematics,Ningbo University,Ningbo 315211,Zhejiang Province,PRC.
Abstract:A kind of nondecreasing subgradient algorithm with appropriate stopping rule has been proposed for nonsmooth constrained minimization problem. The dual theory is invoked in dealing with the stopping rule and general global minimiizing algorithm is employed as a subroutine of the algorithm. The method is expected to tackle a large class of nonsmooth constrained minimization problem.
Keywords:Nonsmooth constrained minimization  duality  subgradient method  stopping rule  convergence  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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