Regularized decomposition of large scale block-structured robust optimization problems
From MaRDI portal
(Redirected from Publication:1789623)
Recommendations
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- scientific article; zbMATH DE number 775096
- Robust Optimization of Large-Scale Systems
- Cutting-set methods for robust convex optimization with pessimizing oracles
- Split cuts for robust mixed-integer optimization
Cites work
- scientific article; zbMATH DE number 3559294 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- A Cholesky dual method for proximal piecewise linear programming
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- A comparison of four approaches from stochastic programming for large-scale unit-commitment
- A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition
- A note on scenario reduction for two-stage stochastic programs
- A primal-proximal heuristic applied to the French unit-commitment problem
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Accelerating Benders method using covering cut bundle generation
- An adaptive partition-based approach for solving two-stage stochastic programs with fixed recourse
- An augmented Lagrangian method for distributed optimization
- Analysis of decomposition algorithms with Benders cuts for p-median problem
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Comparison of bundle and classical column generation
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convergence analysis for mathematical programs with distributionally robust chance constraint
- Convergence of some algorithms for convex minimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Decomposition algorithm for large-scale two-stage unit-commitment
- Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
- Generalized Benders decomposition
- Incremental bundle methods using upper models
- Inexact Cuts in Benders Decomposition
- Inexact bundle methods for two-stage stochastic programming
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- Joint chance constrained programming for hydro reservoir management
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- Large-scale unit commitment under uncertainty
- Level bundle methods for constrained convex optimization with various oracles
- Level bundle methods for oracles with on-demand accuracy
- Logic-based Benders decomposition
- New variants of bundle methods
- On generating maximal nondominated Benders cuts
- On the choice of explicit stabilizing terms in column generation
- Optimal quadratic quantization for numerics: the Gaussian case
- Partitioning procedures for solving mixed-variables programming problems
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Robust Solutions to Uncertain Semidefinite Programs
- Robust convex optimization
- Robust optimization
- Robust solutions of uncertain linear programs
- Solving two-stage robust optimization problems using a column-and-constraint generation method
- The Cutting-Plane Method for Solving Convex Programs
- The unit commitment model with concave emissions costs: a hybrid Benders' decomposition with nonconvex master problems
- Theory and applications of robust optimization
- Tractable approximations to robust conic optimization problems
- Tractable stochastic analysis in high dimensions via robust optimization
- Two-stage robust optimization, state-space representable uncertainty and applications
- Uncontrolled inexact information within bundle methods
Cited in
(3)
This page was built for publication: Regularized decomposition of large scale block-structured robust optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1789623)
