Difference of convex solution of quadratically constrained optimization problems. (Q1810525)
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: Difference of convex solution of quadratically constrained optimization problems. |
scientific article; zbMATH DE number 1924669
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Difference of convex solution of quadratically constrained optimization problems. |
scientific article; zbMATH DE number 1924669 |
Statements
Difference of convex solution of quadratically constrained optimization problems. (English)
0 references
9 June 2003
0 references
Global optimization
0 references
Difference of convex programming
0 references
Outer approximation
0 references
Branch and bound
0 references
0 references
