Uncontrolled inexact information within bundle methods (Q2397754)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Uncontrolled inexact information within bundle methods |
scientific article; zbMATH DE number 6722741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uncontrolled inexact information within bundle methods |
scientific article; zbMATH DE number 6722741 |
Statements
Uncontrolled inexact information within bundle methods (English)
0 references
23 May 2017
0 references
This paper analyzes two bundle algorithms (a proximal one and a level one) handling cheap uncontrolled inexact linearizations, incorporated by an abstract cutting-plane generator. The convergence analysis of the algorithms is given, too. Numerical experiments on two energy optimization problems show that including cheap uncontrolled information can decrease the CPU time to reach optimality.
0 references
non-smooth optimization
0 references
bundle methods
0 references
inexact oracle
0 references
energy optimization
0 references
two-stage stochastic problems
0 references
chance-constrained problems
0 references
convergence
0 references
algorithm
0 references
numerical experiment
0 references
0 references
0 references
0 references
0.7886840105056763
0 references
0.7737151980400085
0 references
0.766866147518158
0 references
0.7667409181594849
0 references
0.7650883197784424
0 references
