Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
From MaRDI portal
Publication:2248747
DOI10.1007/s10107-013-0642-3zbMath1300.90027OpenAlexW1964062286WikidataQ118165455 ScholiaQ118165455MaRDI QIDQ2248747
Antonio Frangioni, Enrico Gorgone
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0642-3
Lagrangian relaxationnondifferentiable optimizationbundle methodsmulticommodity network designstabilized partial Dantzig-Wolfe decomposition
Related Items
Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support, Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization, Lagrangian relaxation for SVM feature selection, Cluster Lagrangean decomposition in multistage stochastic optimization, The proximal Chebychev center cutting plane algorithm for convex additive functions, Revisiting Lagrangian relaxation for network design, A method for convex minimization based on translated first-order approximations, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Construction of autonomous conservation laws, A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring, Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities, On the computational efficiency of subgradient methods: a case study with Lagrangian bounds, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Incremental Bundle Methods using Upper Models, Asynchronous level bundle methods, Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation, Large-scale unit commitment under uncertainty: an updated literature survey, Dynamic smoothness parameter for fast gradient methods, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, A feasible point method with bundle modification for nonsmooth convex constrained optimization, Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design, Divide to conquer: decomposition methods for energy optimization, Proximal bundle methods for nonsmooth DC programming, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Convexity and optimization with copulæ structured probabilistic constraints, A Lagrangian approach to chance constrained routing with local broadcast, Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design, A doubly stabilized bundle method for nonsmooth convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- Composite proximal bundle method
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A stabilized structured Dantzig-Wolfe decomposition method
- Barrier subgradient method
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
- About Lagrangian methods in integer optimization
- Incremental-like bundle methods with application to energy planning
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- An inexact bundle variant suited to column generation
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- On the choice of explicit stabilizing terms in column generation
- On improvements to the analytic center cutting plane method
- A bundle Bregman proximal method for convex nondifferentiable minimization
- Multicommodity network flows: The impact of formulation on decomposition
- The volume algorithm revisited: relation with bundle methods
- A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- New variants of bundle methods
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- New developments in the primal-dual column generation technique
- Solving two-stage stochastic programming problems with level decomposition
- Comparison of bundle and classical column generation
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- New approaches for optimizing over the semimetric polytope
- A bundle-type algorithm for routing in telecommunication data networks
- Lectures on Modern Convex Optimization
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Symmetric and Asymmetric Parallelization of a Cost-Decomposition Algorithm for Multicommodity Flow Problems
- A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design
- Robust Stochastic Approximation Approach to Stochastic Programming
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Introduction to Stochastic Programming
- On constrained optimization by adjoint based quasi-Newton methods
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- The Analytic Center Cutting Plane Method with Semidefinite Cuts
- A Spectral Bundle Method for Semidefinite Programming
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- Generalized Bundle Methods
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- Experiments with a hybrid interior point/combinatorial approach for network flow problems
- Algorithms – ESA 2005
- A geometric study of dual gaps, with applications
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
