Skip to yearly menu bar Skip to main content


Poster

A quasi-Newton proximal splitting method

Stephen Becker · Jalal Fadili

Harrah’s Special Events Center 2nd Floor

Abstract:

We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit the piece-wise linear nature of the dual problem. The second part of the paper applies the previous result to acceleration of convex minimization problems, and leads to an elegant quasi-Newton method. The optimization method compares favorably against state-of-the-art alternatives. The algorithm has extensive applications including signal processing, sparse regression and recovery, and machine learning and classification.

Live content is unavailable. Log in and register to view live content