Uncontrolled inexact information within bundle methods
We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy optimization problems tackled by decomposition....
Saved in:
Main Authors: | Jérôme Malick, Welington de Oliveira, Sofia Zaourar |
---|---|
Format: | article |
Language: | EN |
Published: |
Elsevier
2017
|
Subjects: | |
Online Access: | https://doaj.org/article/b0e12dcf7e334e8aba7a637742b02bad |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
by: Ron Shefi, et al.
Published: (2016) -
A globally convergent algorithm for MPCC
by: Abdeslam Kadrani, et al.
Published: (2015) -
An exact approach for the multi-constraint graph partitioning problem
by: Diego Recalde, et al.
Published: (2020) -
Optimal capacitated ring trees
by: Alessandro Hill, et al.
Published: (2016) -
The complete vertex p-center problem
by: F.Antonio Medrano
Published: (2020)