On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974)
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: On the computational efficiency of subgradient methods: a case study with Lagrangian bounds |
scientific article; zbMATH DE number 6841464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the computational efficiency of subgradient methods: a case study with Lagrangian bounds |
scientific article; zbMATH DE number 6841464 |
Statements
On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (English)
0 references
21 February 2018
0 references
subgradient methods
0 references
nondifferentiable optimization
0 references
computational analysis
0 references
Lagrangian relaxation
0 references
multicommodity network design
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.9141807
0 references
0.90092754
0 references
0.8975612
0 references
0.8967042
0 references
0.8911259
0 references
0.88891023
0 references
0 references
0.8832639
0 references
0.8801925
0 references
