Incremental Bundle Methods using Upper Models
From MaRDI portal
Publication:4603045
DOI10.1137/16M1089897zbMath1392.90094OpenAlexW2531600399WikidataQ118165418 ScholiaQ118165418MaRDI QIDQ4603045
Wim van Ackooij, Antonio Frangioni
Publication date: 14 February 2018
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1089897
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions, Minimizing oracle-structured composite functions, Asynchronous level bundle methods, An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming, Large-scale unit commitment under uncertainty: an updated literature survey, A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions, Decomposition and shortest path problem formulation for solving the hydro unit commitment and scheduling in a hydro valley, Regularized decomposition of large scale block-structured robust optimization problems, A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
Cites Work
- Decomposition algorithm for large-scale two-stage unit-commitment
- Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
- Level bundle methods for constrained convex optimization with various oracles
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- An augmented Lagrangian method for distributed optimization
- About Lagrangian methods in integer optimization
- Incremental-like bundle methods with application to energy planning
- Convergence of some algorithms for convex minimization
- Multicommodity network flows: The impact of formulation on decomposition
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- A method for convex minimization based on translated first-order approximations
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Large-scale unit commitment under uncertainty
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Comparison of bundle and classical column generation
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A primal-proximal heuristic applied to the French unit-commitment problem
- A Nonmonotone Proximal Bundle Method with (Potentially) Continuous Step Decisions
- Level bundle methods for oracles with on-demand accuracy
- Inexact Bundle Methods for Two-Stage Stochastic Programming
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- Piecewise-quadratic Approximations in Convex Numerical Optimization
- A Case Study of Joint Online Truck Scheduling and Inventory Management for Multiple Warehouses
- Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse
- Convergence Analysis of Deflected Conditional Approximate Subgradient Methods
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
- A geometric study of dual gaps, with applications
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- Computational combinatorial optimization. Optimal of probably near-optimal solutions
