A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189): Difference between revisions
From MaRDI portal
Latest revision as of 16:55, 11 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems |
scientific article |
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