Difference of convex solution of quadratically constrained optimization problems. (Q1810525): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:27, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Difference of convex solution of quadratically constrained optimization problems. |
scientific article |
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
