Bundle methods for dual atomic pursuitDownload PDFOpen Website

Published: 2019, Last Modified: 12 May 2023ACSSC 2019Readers: Everyone
Abstract: The aim of structured optimization is to assemble a solution, using a given set of (possibly uncountably infinite) atoms, to fit a model to data. A two-stage algorithm based on gauge duality and bundle method is proposed. The first stage discovers the optimal atomic support for the primal problem by solving a sequence of approximations of the dual problem using a bundle-type method. The second stage recovers the approximate primal solution using the atoms discovered in the first stage. The overall approach leads to implementable and efficient algorithms for large problems.
0 Replies

Loading