Pages that link to "Item:Q2248747"

The following pages link to Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747):

Displaying 30 items.

• A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
• Cluster Lagrangean decomposition in multistage stochastic optimization (Q342253) (← links)
• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• Construction of autonomous conservation laws (Q404876) (← links)
• Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
• Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
• Scenario cluster Lagrangean decomposition for risk averse in multistage stochastic optimization (Q1652363) (← links)
• Lagrangian relaxation for SVM feature selection (Q1652409) (← links)
• A method for convex minimization based on translated first-order approximations (Q1681778) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
• A feasible point method with bundle modification for nonsmooth convex constrained optimization (Q1753350) (← links)
• Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design (Q1754304) (← links)
• A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
• Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design (Q2064301) (← links)
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring (Q2196300) (← links)
• Asynchronous level bundle methods (Q2205980) (← links)
• Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
• Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
• Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Convexity and optimization with copulæ structured probabilistic constraints (Q2817219) (← links)
• Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
• Incremental Bundle Methods using Upper Models (Q4603045) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation (Q5131729) (← links)
• Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
• Stabilized Benders decomposition for energy planning under climate uncertainty (Q6586266) (← links)
• Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)