arXiv:1305.5810 [math.OC]AbstractReferencesReviewsResources
A bundle method using two polyhedral approximations of the epsilon-enlargement of a maximal monotone operator
Published 2013-05-24Version 1
In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use of the transportation formula. Moreover, the use of a double polyhedral approximation in our algorithm could inspire other bundle methods for the case where the given operator can be split as the sum of two other maximal monotone operators.
Related articles: Most relevant | Search more
arXiv:1502.01787 [math.OC] (Published 2015-02-06)
A version of bundle method with linear programming
arXiv:2102.02521 [math.OC] (Published 2021-02-04)
Optimal Control of Plasticity with inertia
arXiv:1711.09959 [math.OC] (Published 2017-11-27)
On the convergence rate of the scaled proximal decomposition on the graph of a maximal monotone operator (SPDG) algorithm