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


A Family of Supermemory Gradient Projection Methods for Constrained Optimization
Abstract:A family of supermemory gradient projection methods for solving the convex constrained optimization problem is presented in this article. It is proven to have stronger convergence properties than the traditional gradient projection method. In particular, it is shown to be globally convergent if the objective function is convex.
Keywords:Projection  Supermemory Gradient  Stationary Point
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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