The following pages link to Generalized Bundle Methods (Q4785872):
Displaying 31 items.
- A simple version of bundle method with linear programming (Q2419511) (← links)
- Comparison of bundle and classical column generation (Q2476993) (← links)
- An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization (Q2483018) (← links)
- Perspective cuts for a class of convex 0-1 mixed integer programs (Q2490334) (← links)
- A proximal trust-region algorithm for column generation stabilization (Q2571184) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Prices stabilization for inexact unit-commitment problems (Q2636928) (← links)
- A bundle-type algorithm for routing in telecommunication data networks (Q2655403) (← links)
- An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems (Q2687444) (← links)
- Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
- A new trust region method for nonsmooth nonconvex optimization (Q3177633) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- An extension of the quasi-Newton method for minimizing locally Lipschitz functions (Q3389584) (← links)
- An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming (Q4620422) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795) (← links)
- Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions (Q5203798) (← links)
- Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- Outer-approximation algorithms for nonsmooth convex MINLP problems (Q5745165) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design (Q5946817) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Lagrangian matheuristics for the quadratic multiple knapsack problem (Q6041829) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)
- Minimizing oracle-structured composite functions (Q6173766) (← links)
- Stabilized Benders decomposition for energy planning under climate uncertainty (Q6586266) (← links)
- A single cut proximal bundle method for stochastic convex composite optimization (Q6634524) (← links)
- Implementation of an oracle-structured bundle method for distributed optimization (Q6640181) (← links)
