Large-scale optimization with the primal-dual column generation method
From MaRDI portal
Publication:266408
DOI10.1007/s12532-015-0090-6zbMath1334.90072arXiv1309.2168OpenAlexW1574951568MaRDI QIDQ266408
Jacek Gondzio, Pablo González-Brevis, Pedro Augusto Munari
Publication date: 13 April 2016
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.2168
convex optimizationcolumn generationinterior point methodscutting plane methodmulticommodity network flow problemmultiple kernel learning problemtwo-stage stochastic programming
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51) Decomposition methods (49M27)
Related Items (15)
A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen ⋮ A new interior-point approach for large separable convex quadratic two-stage stochastic problems ⋮ Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems ⋮ The vehicle allocation problem: alternative formulation and branch-and-price method ⋮ Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen ⋮ On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach ⋮ Consensus-based Dantzig-Wolfe decomposition ⋮ A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem ⋮ A column generation-based heuristic for the split delivery vehicle routing problem with time windows ⋮ Solving Large Scale Optimization Problems in the Transportation Industry and Beyond Through Column Generation ⋮ A specialized primal-dual interior point method for the plastic truss layout optimization ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ Projective Cutting-Planes ⋮ Design and implementation of a modular interior-point solver for linear optimization
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- A stabilized structured Dantzig-Wolfe decomposition method
- SpicyMKL: a fast algorithm for multiple kernel learning with thousands of kernels
- Interior point methods 25 years later
- A new warmstarting strategy for the primal-dual column generation method
- Proximity control in bundle methods for convex nondifferentiable minimization
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Boundedness of solutions for an elliptic equation with non-standard growth
- A multicut algorithm for two-stage stochastic linear programs
- Applications of second-order cone programming
- Partitioning procedures for solving mixed-variables programming problems
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Stabilized column generation
- An interior point method in Dantzig-Wolfe decomposition
- Complexity of some cutting plane methods that use analytic centers
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- An augmented Lagrangian algorithm for large scale multicommodity routing
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems
- Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
- A cutting plane method from analytic centers for stochastic programming
- New variants of bundle methods
- New developments in the primal-dual column generation technique
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- Comparison of bundle and classical column generation
- A bundle-type algorithm for routing in telecommunication data networks
- A Suggested Computation for Maximal Multi-Commodity Network Flows
- On a New Collection of Stochastic Linear Programming Test Problems
- Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- A Linear Programming Approach to the Cutting-Stock Problem
- The Cutting-Plane Method for Solving Convex Programs
- The Decomposition Algorithm for Linear Programs
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- An extended model and a column generation algorithm for the planar multicommodity flow problem
- A regularized decomposition method for minimizing a sum of polyhedral functions
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Progress Made in Solving the Multicommodity Flow Problem
- 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
- Generalized Bundle Methods
- Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems
- Selected Topics in Column Generation
- Implementing Mixed Integer Column Generation
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Large-scale optimization with the primal-dual column generation method
