Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (Q1316098)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 519591
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set |
scientific article; zbMATH DE number 519591 |
Statements
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set (English)
0 references
27 November 1994
0 references
nonconvex minimization
0 references
global optimization
0 references
computational geometry
0 references
rectangle of minimum area
0 references
parametric simplex algorithm
0 references
successive underestimation method
0 references
0 references
0 references
0 references
0.7401740550994873
0 references
0.7335295081138611
0 references
0.7324459552764893
0 references
