期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
NONDESCENT SUBGRADIENT METHOD FOR NONSMOOTH CONSTRAINED MINIMIZATION
1
作者 徐慧福 《Numerical Mathematics A Journal of Chinese Universities(English Series)》 SCIE 1994年第2期126-134,共9页
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 g... 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. 展开更多
关键词 nonsmooth constrained minimization duality subgradient method stopping rule convergence.
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部