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


On the convergence of projected gradient processes to singular critical points
Authors:J C Dunn
Institution:(1) Department of Mathematics, North Carolina State University, Raleigh, North Carolina
Abstract:The projected gradient methods treated here generate iterates by the rulex k+1=P OHgr(x k s k nablaF(x k )),x 1 isin ohm, where ohm is a closed convex set in a real Hilbert spaceX,s k is a positive real number determined by a Goldstein-Bertsekas condition,P OHgr projectsX into ohm,F is a differentiable function whose minimum is sought in ohm, and nablaF is locally Lipschitz continuous. Asymptotic stability and convergence rate theorems are proved for singular local minimizers xgr in the interior of ohm, or more generally, in some open facet in ohm. The stability theorem requires that: (i) xgr is a proper local minimizer andF grows uniformly in ohm near xgr; (ii) –nablaF(xgr) lies in the relative interior of the coneK xgr of outer normals to ohm at xgr; and (iii) xgr is an isolated critical point and the defect parP OHgr(xnablaF(x)) –xpar grows uniformly within the facet containing xgr. The convergence rate theorem imposes (i) and (ii), and also requires that: (iv)F isC 4 near xgr and grows no slower than parxxgrpar4 within the facet; and (v) the projected Hessian operatorP F xgr nabla2 F(xgr)F xgr is positive definite on its range in the subspaceF xgr orthogonal toK xgr. Under these conditions, {x k } converges to xgr from nearby starting pointsx 1, withF(x k ) –F(xgr) =O(k –2) and parx k xgrpar =O(k –1/2). No explicit or implied local pseudoconvexity or level set compactness demands are imposed onF in this analysis. Furthermore, condition (v) and the uniform growth stipulations in (i) and (iii) are redundant in Ropf n .
Keywords:Projected gradient method  convex feasible sets  nonconvex objective functions  singular minimizers
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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