Some fundamental properties of successive convex relaxation methods on LCP and related problems (Q1810868): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0005229 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1643070418 / rank | |||
Normal rank | |||
Latest revision as of 09:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some fundamental properties of successive convex relaxation methods on LCP and related problems |
scientific article |
Statements
Some fundamental properties of successive convex relaxation methods on LCP and related problems (English)
0 references
9 June 2003
0 references
Nonconvex quadratic optimization
0 references
Linear complementarity problem
0 references
Semidefinite programming
0 references
Global optimization
0 references
SDP relaxation
0 references
Convex relaxation
0 references
Lift-and-project procedures
0 references
