The volume algorithm revisited: relation with bundle methods
From MaRDI portal
Publication:1396813
DOI10.1007/s10107-002-0357-3zbMath1023.90038OpenAlexW2090246427MaRDI QIDQ1396813
Publication date: 13 July 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-002-0357-3
bundle methodsextragradient methodvolume algorithma posteriori error boundrectilinear Steiner problemsapproximated primal solution
Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Dynamic bundle methods, A stabilized structured Dantzig-Wolfe decomposition method, Lagrangian heuristic for a class of the generalized assignment problems, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A hybrid Lagrangian metaheuristic for the cross-docking flow shop scheduling problem, Large-scale unit commitment under uncertainty: an updated literature survey, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Comparison of bundle and classical column generation, On embedding the volume algorithm in a variable target value method., A Lagrangian bound for many-to-many assignment problems, The \(k\)-Cardinality Tree Problem: reformulations and Lagrangian relaxation, The omnipresence of Lagrange, Hub-and-spoke network design and fleet deployment for string planning of liner shipping, Essentials of numerical nonsmooth optimization, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, Two ``well-known properties of subgradient optimization, New approaches for optimizing over the semimetric polytope, Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut, Primal convergence from dual subgradient methods for convex optimization, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, Essentials of numerical nonsmooth optimization, Large-scale unit commitment under uncertainty, About Lagrangian methods in integer optimization
Uses Software
