We present an alternating forward–backward splitting method for solving linearly constrained structured optimization problems. The algorithm takes advantage of the separable structure and possibly asymmetric regularity properties of the objective functions involved.We also describe some applications to the study of non-Newtonian fluids and image reconstruction problems. We conclude with a numerical example, and its comparison with Condat’s algorithm. An acceleration heuristic is also briefly outlined.
Alternating forward–backward splitting for linearly constrained optimization problems
Molinari C;
2020-01-01
Abstract
We present an alternating forward–backward splitting method for solving linearly constrained structured optimization problems. The algorithm takes advantage of the separable structure and possibly asymmetric regularity properties of the objective functions involved.We also describe some applications to the study of non-Newtonian fluids and image reconstruction problems. We conclude with a numerical example, and its comparison with Condat’s algorithm. An acceleration heuristic is also briefly outlined.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
s11590-019-01388-y.pdf
accesso chiuso
Descrizione: Articolo
Tipologia:
Documento in versione editoriale
Dimensione
662.28 kB
Formato
Adobe PDF
|
662.28 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
