The following pages link to Generalized Bundle Methods (Q4785872):
Displaying 50 items.
- Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- Large-scale optimization with the primal-dual column generation method (Q266408) (← links)
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization (Q285034) (← links)
- A cross-decomposition scheme with integrated primal-dual multi-cuts for two-stage stochastic programming investment planning problems (Q291046) (← links)
- Using the primal-dual interior point algorithm within the branch-price-and-cut method (Q336429) (← links)
- The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- A spline smoothing Newton method for finite minimax problems (Q525261) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- An active set smoothing method for solving unconstrained minimax problems (Q779576) (← links)
- About Lagrangian methods in integer optimization (Q817183) (← links)
- A generalization of column generation to accelerate convergence (Q847856) (← links)
- A bundle modification strategy for convex minimization (Q869143) (← links)
- A trust region method for the solution of the surrogate dual in integer programming (Q896175) (← links)
- Decomposition schemes and acceleration techniques in application to production-assembly-distribution system design (Q925847) (← links)
- Discrete gradient method: Derivative-free method for nonsmooth optimization (Q946181) (← links)
- A bundle-filter method for nonsmooth convex constrained optimization (Q959944) (← links)
- Incremental-like bundle methods with application to energy planning (Q975362) (← links)
- A truncated aggregate smoothing Newton method for minimax problems (Q979271) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- On the choice of explicit stabilizing terms in column generation (Q1025985) (← links)
- 0-1 reformulations of the multicommodity capacitated network design problem (Q1025989) (← links)
- Computing sharp bounds for hard clustering problems on trees (Q1028427) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- Lagrangian relaxation for SVM feature selection (Q1652409) (← 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 column generation heuristic for optimal wireless sensor network design with mobile sinks (Q1753436) (← links)
- An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
- Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
- A multistage stochastic programming approach for preventive maintenance scheduling of GENCOs with natural gas contract (Q2023991) (← links)
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem (Q2030649) (← links)
- Gaining traction: on the convergence of an inner approximation scheme for probability maximization (Q2045616) (← links)
- A Lagrangian approach to chance constrained routing with local broadcast (Q2056917) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- A regularized smoothing method for fully parameterized convex problems with applications to convex and nonconvex two-stage stochastic programming (Q2230935) (← 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)
- A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems (Q2342127) (← links)
- Aggregate codifferential method for nonsmooth DC optimization (Q2349678) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- Tuning strategy for the proximity parameter in convex minimization (Q2370054) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- Dynamic bundle methods (Q2390994) (← links)
- Uncontrolled inexact information within bundle methods (Q2397754) (← links)
