Generalized Bundle Methods
From MaRDI portal
Recommendations
- A bundle Bregman proximal method for convex nondifferentiable minimization
- scientific article; zbMATH DE number 1568985
- A doubly stabilized bundle method for nonsmooth convex optimization
- A proximal bundle method for nonsmooth and nonconvex constrained optimization
- Bundle method for non-convex minimization with inexact subgradients and function values
Cited in
(88)- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- On the choice of explicit stabilizing terms in column generation
- 0-1 reformulations of the multicommodity capacitated network design problem
- Computing sharp bounds for hard clustering problems on trees
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen
- Lagrangian relaxation for SVM feature selection
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Large-scale unit commitment under uncertainty: an updated literature survey
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions
- A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- Gaining traction: on the convergence of an inner approximation scheme for probability maximization
- A Lagrangian approach to chance constrained routing with local broadcast
- A new restricted memory level bundle method for constrained convex nonsmooth optimization
- Revisiting augmented Lagrangian duals
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Proximal bundle methods for nonsmooth DC programming
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems
- Aggregate codifferential method for nonsmooth DC optimization
- Large-scale unit commitment under uncertainty
- Tuning strategy for the proximity parameter in convex minimization
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Dynamic bundle methods
- Uncontrolled inexact information within bundle methods
- A simple version of bundle method with linear programming
- Comparison of bundle and classical column generation
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- A proximal trust-region algorithm for column generation stabilization
- New approaches for optimizing over the semimetric polytope
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- A doubly stabilized bundle method for nonsmooth convex optimization
- Prices stabilization for inexact unit-commitment problems
- A bundle-type algorithm for routing in telecommunication data networks
- Large-scale optimization with the primal-dual column generation method
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems
- A new trust region method for nonsmooth nonconvex optimization
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- A stabilized structured Dantzig-Wolfe decomposition method
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- Network-based approximate linear programming for discrete optimization
- Trust-region methods for the derivative-free optimization of nonsmooth black-box functions
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A splitting bundle approach for non-smooth non-convex minimization
- A spline smoothing Newton method for finite minimax problems
- Outer-approximation algorithms for nonsmooth convex MINLP problems
- Essentials of numerical nonsmooth optimization
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Essentials of numerical nonsmooth optimization
- Lagrangian matheuristics for the quadratic multiple knapsack problem
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods
- A version of bundle trust region method with linear programming
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Minimizing oracle-structured composite functions
- A new nonmonotone line search method for nonsmooth nonconvex optimization
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Stabilized Benders decomposition for energy planning under climate uncertainty
- A single cut proximal bundle method for stochastic convex composite optimization
- Implementation of an oracle-structured bundle method for distributed optimization
- Dynamic smoothness parameter for fast gradient methods
- Proximal oracles for optimization and sampling
- A randomized method for handling a difficult function in a convex optimization problem, motivated by probabilistic programming
- Neural Benders decomposition for mixed-integer programming
- A proximal bundle approach for solving the generalized variational inequalities with inexact data
- Level bundle-like algorithms for convex optimization
- An active set smoothing method for solving unconstrained minimax problems
- About Lagrangian methods in integer optimization
- A generalization of column generation to accelerate convergence
- A bundle modification strategy for convex minimization
- A trust region method for the solution of the surrogate dual in integer programming
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design
- Discrete gradient method: Derivative-free method for nonsmooth optimization
- A bundle-filter method for nonsmooth convex constrained optimization
- Incremental-like bundle methods with application to energy planning
- A truncated aggregate smoothing Newton method for minimax problems
This page was built for publication: Generalized Bundle Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785872)
