2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDSPTM-21.2
Paper Title YAPA: ACCELERATED PROXIMAL ALGORITHM FOR CONVEX COMPOSITE PROBLEMS
Authors Giovanni Chierchia, LIGM, Univ Gustave Eiffel, CNRS, ESIEE Paris, France; Mireille El Gheche, Ecole Polytechnique Fédérale de Lausanne (EPFL) / LTS4, Switzerland
SessionSPTM-21: Optimization Methods for Signal Processing
LocationGather.Town
Session Time:Friday, 11 June, 13:00 - 13:45
Presentation Time:Friday, 11 June, 13:00 - 13:45
Presentation Poster
Topic Signal Processing Theory and Methods: [OPT] Optimization Methods for Signal Processing
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract Proximal splitting methods are standard tools for nonsmooth optimization. While primal-dual methods have become very popular in the last decade for their flexibility, primal methods may still be preferred for two reasons: acceleration schemes are more effective, and only a single stepsize is required. In this paper, we propose a primal proximal method derived from a three-operator splitting in a product space and accelerated with Anderson extrapolation. The proposed algorithm can activate smooth functions via their gradients, and allows for linear operators in nonsmooth functions. Numerical results show the good performance of our algorithm with respect to well-established modern optimization methods.