Cycling can occur in Mráz's algorithm for nonconvex quadratic programming (Q1310620)
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: Cycling can occur in Mráz's algorithm for nonconvex quadratic programming |
scientific article; zbMATH DE number 482262
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycling can occur in Mráz's algorithm for nonconvex quadratic programming |
scientific article; zbMATH DE number 482262 |
Statements
Cycling can occur in Mráz's algorithm for nonconvex quadratic programming (English)
0 references
7 July 1994
0 references
Beale's algorithm
0 references
nonconvex quadratic programming
0 references
counterexample
0 references
cycling
0 references
0.8147161602973938
0 references
0.7201303243637085
0 references
0.6976974606513977
0 references
