Cover Image

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luo, Fengqiao, Dey, Shibshankar, Mehrotra, Sanjay
Format:	Preprint
Published:	2021
Subjects:	Optimization and Control 90
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On Solving Chance-Constrained Models with Gaussian Mixture Distribution
by: Dey, Shibshankar, et al.
Published: (2025)

Coordinated Vehicle Platooning on Tree Networks: Efficient Time Discretization and Strengthened Formulation
by: Luo, Fengqiao
Published: (2022)

Structured Nonsmooth Optimization Using Functional Encoding and Branching Information
by: Luo, Fengqiao
Published: (2024)

Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)

A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
by: Hojny, Christopher, et al.
Published: (2025)

Optimization Modeling for Pandemic Vaccine Supply Chain Management: A Review and Future Research Opportunities
by: Dey, Shibshankar, et al.
Published: (2023)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Penalty-Free SDDP: Feasibility Cuts for Robust Multi-Stage Stochastic Optimization in Energy Planning
by: Freitas, Guilherme, et al.
Published: (2025)

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

Bus Fleet Electrification Planning Through Logic-Based Benders Decomposition and Restriction Heuristics
by: Legault, Robin, et al.
Published: (2025)

Sparse Convex Quantile Regression: A Generalized Benders Decomposition Approach
by: Luo, Xiaoyu, et al.
Published: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
by: Dienstbier, Jana, et al.
Published: (2023)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

Convergence and Bound Computation for Chance Constrained Distributionally Robust Models using Sample Approximation
by: Lei, Jiaqi, et al.
Published: (2024)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
by: Tanınmış, Kübra, et al.
Published: (2023)

Variance Reduced Distributed Non-Convex Optimization Using Matrix Stepsizes
by: Li, Hanmin, et al.
Published: (2023)

Learning to Cut: Reinforcement Learning for Benders Decomposition
by: Cai, Haochen, et al.
Published: (2026)

Dynamic Systems Coupled with Solutions of Stochastic Nonsmooth Convex Optimization
by: Luo, Jianfeng, et al.
Published: (2025)

An Adaptive Three-Stage Algorithm For Solving Adjustable Min-Max-Regret Problems
by: Schneider, Kerstin, et al.
Published: (2024)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Bi-Parameterized Two-Stage Stochastic Min-Max and Min-Min Mixed Integer Programs
by: Kang, Sumin, et al.
Published: (2025)

An Empirical Quantile Estimation Approach to Nonlinear Optimization Problems with Chance Constraints
by: Luo, Fengqiao, et al.
Published: (2022)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
by: Del Pia, Alberto
Published: (2023)

$\mathcal{V}$-Polyhedral Disjunctive Cuts
by: Balas, Egon, et al.
Published: (2022)

Parallelized Conflict Graph Cut Generation
by: Dai, Yongzheng, et al.
Published: (2023)

Convexoid: A Minimal Theory of Conjugate Convexity
by: Wei, Ningji
Published: (2024)

Comparative Analysis of Two-Stage Distributionally Robust Optimization over 1-Wasserstein and 2-Wasserstein Balls
by: Byeon, Geunyeong
Published: (2025)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
by: Guo, Feng, et al.
Published: (2023)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
by: Xiaoyu, Luo, et al.
Published: (2024)

A Fully Parameter-Free Second-Order Algorithm for Convex-Concave Minimax Problems
by: Wang, Junlin, et al.
Published: (2024)

On Difference-of-SOS and Difference-of-Convex-SOS Decompositions for Polynomials
by: Niu, Yi-Shuai, et al.
Published: (2018)

Convex quartic problems: homogenized gradient method and preconditioning
by: Dragomir, Radu-Alexandru, et al.
Published: (2023)

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
by: Gao, Lucy L., et al.
Published: (2023)

Revisiting Johnson's rule for minimizing makespan in the Two-Machine Flow Shop scheduling problem
by: Della Croce, Federico, et al.
Published: (2025)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)

Distributionally Risk-Receptive and Robust Multistage Stochastic Integer Programs and Interdiction Models
by: Kang, Sumin, et al.
Published: (2024)

Benders Decomposition for Robust Tactical Railway Crew Scheduling
by: van Rossum, B. T. C., et al.
Published: (2024)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
by: Goerigk, Marc, et al.
Published: (2026)

Disjunctive Benders Decomposition
by: Fang, Kaiwen, et al.
Published: (2025)