Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645)
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: Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B |
scientific article; zbMATH DE number 7692822
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B |
scientific article; zbMATH DE number 7692822 |
Statements
Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (English)
0 references
5 June 2023
0 references
semidefinite programming
0 references
cutting-plane method
0 references
augmented Lagrangian method
0 references
max-cut problem
0 references
0 references
0 references
0 references
0 references
0.833146333694458
0 references
0.8308764100074768
0 references
0.8214523196220398
0 references
0.8182646036148071
0 references
0.8128442168235779
0 references
