:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Kedad-Sidhoum, Safia, Medvedev, Anton, Meunier, Frédéric
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 90C17
Online Access:	https://arxiv.org/abs/2305.05399
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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