Cover Image

An Adaptive Three-Stage Algorithm For Solving Adjustable Min-Max-Regret Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Schneider, Kerstin, Krieg, Helene, Nowak, Dimitri, Küfer, Karl-Heinz
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C17
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Computational Study for Solving Decision-Dependent Robust Problems as Bilevel Optimization Problems
by: Lefebvre, Henri, et al.
Published: (2025)

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

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties
by: Thürauf, Johannes, et al.
Published: (2024)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
by: Schwientek, Jan, et al.
Published: (2025)

Policy Gradient Algorithms for Robust MDPs with Non-Rectangular Uncertainty Sets
by: Li, Mengmeng, et al.
Published: (2023)

Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability
by: Kedad-Sidhoum, Safia, et al.
Published: (2023)

A Gauge Set Framework for Flexible Robustness Design
by: Wei, Ningji, et al.
Published: (2025)

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

Multicriteria Adjustable Regret Robust Optimization for Building Energy Supply Design
by: Halser, Elisabeth, et al.
Published: (2024)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
by: Rahimi, Morteza, et al.
Published: (2025)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
by: Leijenhorst, Nando, et al.
Published: (2022)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
by: Thomä, Simon, et al.
Published: (2022)

Sparse Polynomial Optimization with Unbounded Sets
by: Huang, Lei, et al.
Published: (2024)

Sparse Polynomial Matrix Optimization
by: Miller, Jared, et al.
Published: (2024)

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

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
by: Rothschild, Jacob H.
Published: (2024)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
by: Liang, Ling, et al.
Published: (2024)

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
by: Halffmann, Pascal, et al.
Published: (2024)

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions
by: Dienstbier, J., et al.
Published: (2023)

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

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Gradient Norm Regularization Second-Order Algorithms for Solving Nonconvex-Strongly Concave Minimax Problems
by: Wang, Jun-Lin, et al.
Published: (2024)

Splitting Algorithms for Distributionally Robust Optimization
by: Briceño-Arias, Luis, et al.
Published: (2024)

Solving the Market Split Problem with Lattice Enumeration
by: Wassermann, Alfred
Published: (2025)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Robust Solutions of Nonlinear Least Squares Problems via Min-max Optimization
by: Chen, Xiaojun, et al.
Published: (2024)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
by: Lakshmanan, K
Published: (2023)

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
by: Chagas, Vítor Gomes, et al.
Published: (2026)

Commutation principles for nonsmooth variational problems on Euclidean Jordan algebras
by: Jeong, Juyoung, et al.
Published: (2024)

Adaptive Partitioning for Chance-Constrained Problems with Finite Support
by: Roland, Marius, et al.
Published: (2023)

Stochastic dynamic programming under recursive Epstein-Zin preferences
by: Jaśkiewicz, Anna, et al.
Published: (2024)

Bounding the density of spherical polygon packings
by: Filho, Fernando Mário de Oliveira, et al.
Published: (2026)

Is Noisy Data a Blessing in Disguise? A Distributionally Robust Optimization Perspective
by: Hsieh, Chung-Han, et al.
Published: (2025)

An Algorithm to Solve Cardinality Constrained Quadratic Optimization Problem with an Application to the Best Subset Selection in Regression
by: Singh, Vikram, et al.
Published: (2025)

Spectral Outer-Approximation Algorithms for Binary Semidefinite Problems
by: de Roux, Daniel, et al.
Published: (2025)

A Highly Efficient Adaptive-Sieving-Based Algorithm for the High-Dimensional Rank Lasso Problem
by: Bai, Xiaoning, et al.
Published: (2022)

Superlinear Convergence of an Interior Point Algorithm on Linear Semi-definite Feasibility Problems
by: Sim, Chee-Khian
Published: (2022)

Quantifying the Safety of Trajectories using Peak-Minimizing Control
by: Miller, Jared, et al.
Published: (2023)