首页|A Novel Quasi-Newton Method for Composite Convex Minimization
A Novel Quasi-Newton Method for Composite Convex Minimization
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
A fast parallelable Jacobi iteration type optimization method for non-smooth convex composite optimization is presented. Traditional gradient-based techniques cannot solve the problem. Smooth approximate functions are attempted to be used as a replacement of those non-smooth terms without compromising the accuracy. Recently, proximal mapping concept has been introduced into this field. Techniques which utilize proximal average based proximal gradient have been used to solve the problem. The state-of-art methods only utilize first-order information of the smooth approximate function. We integrate both first and second-order techniques to use both first and second-order information to boost the convergence speed. A convergence rate with a lower bound of O(1/k(2)) is achieved by the proposed method and a super-linear convergence is enjoyed when there is proper second-order information. In experiments, the proposed method converges significantly better than the state of art methods which enjoy O(1/k) convergence. (C) 2021 Elsevier Ltd. All rights reserved.
non-smoothproximal mappingquasi-NewtonALTERNATING DIRECTION METHODNONSMOOTHALGORITHMS
NSTL
Elsevier
