Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming |
scientific article |
Statements
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (English)
0 references
12 April 2018
0 references
basic step
0 references
disjunctive programming
0 references
\(K\)-means clustering
0 references
Lagrangian decomposition
0 references
mixed-integer conic quadratic optimization
0 references
0 references
0 references
