On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
From MaRDI portal
Publication:1697974
DOI10.1007/s12532-017-0120-7zbMath1393.90072WikidataQ118165429 ScholiaQ118165429MaRDI QIDQ1697974
Antonio Frangioni, Bernard Gendron, Enrico Gorgone
Publication date: 21 February 2018
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/851793
Lagrangian relaxation; nondifferentiable optimization; subgradient methods; computational analysis; multicommodity network design
Uses Software