A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189)
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 Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems |
scientific article; zbMATH DE number 6562688
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems |
scientific article; zbMATH DE number 6562688 |
Statements
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (English)
0 references
4 April 2016
0 references
linearly constrained quadratic optimization problems with complementarity constraints
0 references
Lagrangian-conic relaxation
0 references
bisection method
0 references
iterative solver
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.911459505558014
0 references
0.827154815196991
0 references
0.8125857710838318
0 references
0.7971701622009277
0 references
