A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem (Q901339)
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 deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem |
scientific article; zbMATH DE number 6528339
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem |
scientific article; zbMATH DE number 6528339 |
Statements
A deterministic annealing algorithm for approximating a solution of the linearly constrained nonconvex quadratic minimization problem (English)
0 references
11 January 2016
0 references
nonconvex quadratic minimization
0 references
linear constraints
0 references
Hopfield-type barrier function
0 references
Lagrange multiplier
0 references
descent direction
0 references
iterative algorithm
0 references
0.7935144305229187
0 references
0.7817611694335938
0 references
0.7651936411857605
0 references
0.757389485836029
0 references
