306. Non-expansiveness for frugal resolvent splitting methods, using PEP
Invited abstract in session WF-2: Recent advances in computer-aided analyses of optimization algorithms II, stream Conic optimization: theory, algorithms and applications.
Wednesday, 16:20 - 18:00Room: M:O
Authors (first author is the speaker)
| 1. | Anton Åkerman
|
| Department of Automatic Control, Lund University | |
| 2. | Emanuele Naldi
|
| Mathematics, Università di Genova | |
| 3. | Enis Chenchene
|
| 4. | Sebastian Banert
|
| Uni Bremen | |
| 5. | Pontus Giselsson
|
| Dept. of Automatic Control, Lund University |
Abstract
This talk focuses on frugal resolvent splitting methods with minimal lifting. A PEP-formulation is presented, and used to derive conditions for non-expansiveness for this class of algorithms. Some further results are presented, and a few notes are given on more general conditions for convergence.
Keywords
- Conic and semidefinite optimization
- Convex and non-smooth optimization
Status: accepted
Back to the list of papers