A Novel Quasi-Newton Method for Composite Convex Minimization

W. H. Chai, S. S. Ho, H. C. Quek

Research output: Contribution to journalArticlepeer-review


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([Formula presented]) 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([Formula presented]) convergence.

Original languageAmerican English
Article number108281
JournalPattern Recognition
StatePublished - Feb 2022

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Computer Vision and Pattern Recognition
  • Artificial Intelligence


Dive into the research topics of 'A Novel Quasi-Newton Method for Composite Convex Minimization'. Together they form a unique fingerprint.

Cite this