Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (Q3978620)
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: Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron |
scientific article; zbMATH DE number 12567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron |
scientific article; zbMATH DE number 12567 |
Statements
Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron (English)
0 references
25 June 1992
0 references
global optimization
0 references
concave quadratic function
0 references
linear inequality constraints
0 references
global minimizer
0 references
branch-and-bound
0 references
0.8966107
0 references
0.88929117
0 references
0.8842964
0 references
0.87934047
0 references
0.87727535
0 references
0.8763172
0 references
0.8747698
0 references
0.8723292
0 references
0.8720643
0 references
