Using deep cuts in an ellipsoid algorithm for nonlinear programming (Q3707772)
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 3932803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using deep cuts in an ellipsoid algorithm for nonlinear programming |
scientific article; zbMATH DE number 3932803 |
Statements
Using deep cuts in an ellipsoid algorithm for nonlinear programming (English)
0 references
1985
0 references
ellipsoid algorithm
0 references
computational experiments
0 references
deep-cut hyperplanes
0 references
convex and nonconvex problems
0 references
0.8522052764892578
0 references
0.8258001208305359
0 references
0.8215470910072327
0 references
0.8215470910072327
0 references
