A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (Q1123811)
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: A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming |
scientific article; zbMATH DE number 4110471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming |
scientific article; zbMATH DE number 4110471 |
Statements
A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming (English)
0 references
1989
0 references
The authors study the performance of some rank-two ellipsoid algorithms using well-known nonlinear programming problems. Numerical experiments are reported which show tht the rank-two algorithms studied are slightly less efficient than the usual center-cut (rank-one) method. Some results are also presented concerning the growth of ellipsoid asphericity in rank-one and rank-two algorithms.
0 references
rank-two ellipsoid algorithms
0 references
Numerical experiments
0 references
0 references
