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....
Guardado en:
Autores principales: | Jérôme Malick, Welington de Oliveira, Sofia Zaourar |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Elsevier
2017
|
Materias: | |
Acceso en línea: | https://doaj.org/article/b0e12dcf7e334e8aba7a637742b02bad |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
por: Ron Shefi, et al.
Publicado: (2016) -
A globally convergent algorithm for MPCC
por: Abdeslam Kadrani, et al.
Publicado: (2015) -
An exact approach for the multi-constraint graph partitioning problem
por: Diego Recalde, et al.
Publicado: (2020) -
Optimal capacitated ring trees
por: Alessandro Hill, et al.
Publicado: (2016) -
The complete vertex p-center problem
por: F.Antonio Medrano
Publicado: (2020)