On solving nonconvex optimization problems by reducing the duality gap (Q2494287): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:25, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On solving nonconvex optimization problems by reducing the duality gap |
scientific article |
Statements
On solving nonconvex optimization problems by reducing the duality gap (English)
0 references
26 June 2006
0 references
branch and bound algorithm
0 references
convergence conditions
0 references
dual bound
0 references
Lagrangian bound
0 references
partly convex programming
0 references
partly linear optimization
0 references
