An inexact bundle variant suited to column generation
From MaRDI portal
Publication:1016116
DOI10.1007/s10107-007-0187-4zbMath1163.65039OpenAlexW2091352139MaRDI QIDQ1016116
Claude Lemaréchal, Krzysztof C. Kiwiel
Publication date: 4 May 2009
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0187-4
Numerical mathematical programming methods (65K05) Convex programming (90C25) Combinatorial optimization (90C27)
Related Items
Scalable branching on dual decomposition of stochastic mixed-integer programming problems, A stabilized structured Dantzig-Wolfe decomposition method, Fast bundle-level methods for unconstrained and ball-constrained convex optimization, Level bundle methods for constrained convex optimization with various oracles, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, A two-phase algorithm for a variational inequality formulation of equilibrium problems, An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems, Regularized optimization methods for convex MINLP problems, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Derivative-free optimization via proximal point methods, Comparison of bundle and classical column generation, Incremental-like bundle methods with application to energy planning, Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values, The omnipresence of Lagrange, Penalized sample average approximation methods for stochastic programs in economic and secure dispatch of a power system, On the choice of explicit stabilizing terms in column generation, A splitting bundle approach for non-smooth non-convex minimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On approximations with finite precision in bundle methods for nonsmooth optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- A constraint linearization method for nondifferentiable convex minimization
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Newton's method for convex programming and Tschebyscheff approximation
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Convergence of some algorithms for convex minimization
- A Cholesky dual method for proximal piecewise linear programming
- Non-Euclidean restricted memory level method for large-scale convex optimization
- Approximations in proximal bundle methods and decomposition of convex programs
- Finding normal solutions in piecewise linear programming
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Methods of descent for nondifferentiable optimization
- Comparison of bundle and classical column generation
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- An Inexact Bundle Approach to Cutting-Stock Problems
- A Linear Programming Approach to the Cutting-Stock Problem
- The Cutting-Plane Method for Solving Convex Programs
- An Algorithm for Nonsmooth Convex Minimization With Errors
- Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods
- An Algorithm for Constrained Optimization with Semismooth Functions
- A Column Generation Approach for Graph Coloring
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Selected Topics in Column Generation
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Cutting Stock Problems
- Convex Analysis
- A proximal bundle method based on approximate subgradients
