Imagen de Portada

Finite adaptability in two-stage robust optimization: asymptotic optimality and tractability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kedad-Sidhoum, Safia, Medvedev, Anton, Meunier, Frédéric
Formato:	Preprint
Publicado:	2023
Materias:	Optimization and Control 90C17
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Correction to: A Lagrangian dual method for two-stage robust optimization with binary uncertainties
por: Lefebvre, Henri, et al.
Publicado: (2024)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
por: Bomze, Immanuel, et al.
Publicado: (2024)

Scaling limits of multi-period distributionally robust optimization problems
por: Nendel, Max, et al.
Publicado: (2025)

A note on the complexity of two-stage stochastic linear optimization with small second stage
por: Buchheim, Christoph
Publicado: (2026)

An uncertainty model for positive-valued parameters with application to robust optimization
por: Tanaka, Tatsuya, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
por: Li, Huimin, et al.
Publicado: (2025)

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

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
por: Nishioka, Akatsuki, et al.
Publicado: (2023)

Bundle methods with quadratic cuts for deterministic and stochastic strongly convex optimization problems
por: Guigues, Vincent, et al.
Publicado: (2017)

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

Some optimality conditions of set-valued optimization problems in locally convex topological vector spaces
por: Zeng, Renying
Publicado: (2024)

New merit functions for multiobjective optimization and their properties
por: Tanabe, Hiroki, et al.
Publicado: (2020)

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

Depth-first directional search for nonconvex optimization
por: Zhang, Yuxuan, et al.
Publicado: (2024)

On the directional asymptotic approach in optimization theory
por: Benko, Matúš, et al.
Publicado: (2024)

Exact augmented Lagrangian duality for mixed integer convex optimization
por: Bhardwaj, Avinash, et al.
Publicado: (2022)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2024)

Second-order cone programming for distributionally robust compliance optimization of trusses considering input distribution uncertainty
por: Fujiyama, Takumi, et al.
Publicado: (2025)

Existence of solutions for polyhedral convex set optimization problems
por: Löhne, Andreas
Publicado: (2023)

A new envelope function for nonsmooth DC optimization
por: Themelis, Andreas, et al.
Publicado: (2020)

Relaxations for binary polynomial optimization via signed certificates
por: Xu, Liding, et al.
Publicado: (2024)

Speeding up the Goemans-Williamson randomized procedure by difference-of-convex optimization
por: Salloum, Hadi, et al.
Publicado: (2025)

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

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
por: Audet, Charles, et al.
Publicado: (2026)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
por: Slot, Lucas
Publicado: (2021)

Duality-based single-level reformulations of bilevel optimization problems
por: Dempe, Stephan, et al.
Publicado: (2024)

Commutation principles for optimization problems involving strictly Schur-convex functions in Euclidean Jordan algebras
por: Massey, Pedro G., et al.
Publicado: (2025)

Some commutation principles for optimization problems over transformation groups and semi-FTvN systems
por: Gowda, M. Seetharama, et al.
Publicado: (2025)

Decision-focused predictions via pessimistic bilevel optimization: complexity and algorithms
por: Bucarey, Víctor, et al.
Publicado: (2023)

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