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
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10107-015-0874-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083411653 / rank | |||
Normal rank | |||
Revision as of 18:53, 19 March 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
