On a decomposition method for nonconvex global optimization (Q2463828): Difference between revisions
From MaRDI portal
Latest revision as of 13:58, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On a decomposition method for nonconvex global optimization |
scientific article |
Statements
On a decomposition method for nonconvex global optimization (English)
0 references
6 December 2007
0 references
The author presents a rigorous framework for convergence results for the branch and bound decomposition method in nonconvex global optimization. The essential assumptions needed to prove convergence for the branch and bound decomposition scheme with Lagrangian bounds are discussed in detail. This discussion leads, among other results, to a counter example to some similar statements in the recent literature. Special attention is given to partly convex problems as well as partly monotonic and monotonic/linear problems.
0 references
nonconvex global optimization
0 references
parametric optimization
0 references
partly convex
0 references
partly monotonic
0 references
monotonic/linear problems
0 references
branch and bound decomposition algorithm
0 references
Lagrangian bound
0 references
duality gap
0 references
convergence conditions
0 references
0 references
0 references
