Regularized decomposition of large scale block-structured robust optimization problems
type: Item
instance of: scholarly article
title: Regularized decomposition of large scale block-structured robust optimization problems
zbMATH Open document ID: 1397.90303
author: Wim van Ackooij
author: Nicolas Lebbe
author: Jérôme Malick
published in: Computational Management Science
publication date: 2018-10-10T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6950391
zbMATH Keywords: large scale block-structured problems
zbMATH Keywords: robust optimization
zbMATH Keywords: cutting-plane methods
zbMATH Keywords: bundle methods
zbMATH Keywords: unit-commitment
MaRDI profile type: Publication
full work available at URL: s10287-017-0281-x
OpenAlex ID: W2617881386
cites work: Tractable stochastic analysis in high dimensions via robust optimization
cites work: On the choice of explicit stabilizing terms in column generation
cites work: Robust convex optimization
cites work: Robust solutions of uncertain linear programs
cites work: Q3182207
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Tractable approximations to robust conic optimization problems
cites work: Theory and Applications of Robust Optimization
cites work: Comparison of bundle and classical column generation
cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse
cites work: An augmented Lagrangian method for distributed optimization
cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
cites work: Convergence of some algorithms for convex minimization
cites work: Level bundle methods for oracles with on-demand accuracy
cites work: Inexact Bundle Methods for Two-Stage Stochastic Programming
cites work: Convex proximal bundle methods in depth: a unified analysis for inexact oracles
cites work: A primal-proximal heuristic applied to the French unit-commitment problem
cites work: Robust Solutions to Least-Squares Problems with Uncertain Data
cites work: Robust Solutions to Uncertain Semidefinite Programs
cites work: Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
cites work: Generalized Benders decomposition
cites work: Convergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint
cites work: A proximal bundle method for nonsmooth nonconvex functions with inexact information
cites work: A note on scenario reduction for two-stage stochastic programs
cites work: Logic-based Benders decomposition
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
cites work: A Cholesky dual method for proximal piecewise linear programming
cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations
cites work: Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem
cites work: Q4132264
cites work: New variants of bundle methods
cites work: Uncontrolled inexact information within bundle methods
cites work: Two-stage robust optimization, state-space representable uncertainty and applications
cites work: Optimal quadratic quantization for numerics: the Gaussian case
cites work: Accelerating Benders method using covering cut bundle generation
cites work: On generating maximal nondominated Benders cuts
cites work: An Adaptive Partition-Based Approach for Solving Two-Stage Stochastic Programs with Fixed Recourse
cites work: Large-scale unit commitment under uncertainty
cites work: Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
cites work: A comparison of four approaches from stochastic programming for large-scale unit-commitment
cites work: Level bundle methods for constrained convex optimization with various oracles
cites work: Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
cites work: Incremental Bundle Methods using Upper Models
cites work: Decomposition algorithm for large-scale two-stage unit-commitment
cites work: Joint chance constrained programming for hydro reservoir management
cites work: Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
cites work: Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
cites work: The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
cites work: L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
cites work: Q4716341
cites work: Inexact Cuts in Benders Decomposition
cites work: Solving two-stage robust optimization problems using a column-and-constraint generation method
cites work: A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
DOI: 10.1007/S10287-017-0281-X
description: scientific article; zbMATH DE number 6950391