Quantitative stability analysis for minimax distributionally robust risk optimization
DOI10.1007/S10107-018-1347-4zbMATH Open1489.90089OpenAlexW2614002454WikidataQ128977459 ScholiaQ128977459MaRDI QIDQ2118071FDOQ2118071
Authors: Alois Pichler, Huifu Xu
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/425755/1/Pichler_Xu_MPB.pdf
Recommendations
- Quantitative stability of two-stage distributionally robust risk optimization problem with full random linear semi-definite recourse
- Quantitative stability analysis for distributionally robust optimization with moment constraints
- Stability of a class of risk-averse multistage stochastic programs and their distributionally robust counterparts
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Convergence analysis for distributionally robust optimization and equilibrium problems
Applications of statistics to actuarial sciences and financial mathematics (62P05) Probability measures on topological spaces (60B05) Stochastic programming (90C15) Robustness in mathematical programming (90C17)
Cites Work
- Measure Theory and Probability Theory
- Title not available (Why is that?)
- On Choosing and Bounding Probability Metrics
- A Survey of the S-Lemma
- Convex analysis and measurable multifunctions
- Scenario reduction in stochastic programming
- Scenario reduction algorithms in stochastic programming
- Foundations of quantization for probability distributions
- A note on scenario reduction for two-stage stochastic programs
- Tree approximation for discrete time stochastic processes: a process distance approach
- Robust optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributionally robust joint chance constraints with second-order moment information
- The Cutting-Plane Method for Solving Convex Programs
- On the rate of convergence in Wasserstein distance of the empirical measure
- Minimax Theorems
- Title not available (Why is that?)
- A space quantization method for numerical integration
- Quantitative Stability in Stochastic Programming: The Method of Probability Metrics
- On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
- A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization
- Lectures on stochastic programming. Modeling and theory.
- Title not available (Why is that?)
- Kusuoka representation of higher order dual risk measures
- Title not available (Why is that?)
- The natural Banach space for version independent risk measures
- Multistage stochastic optimization
- Title not available (Why is that?)
- On Kusuoka representation of law invariant risk measures
- Sur la fonction d'appui des ensembles convexes dans un espace localement convexe
- Ambiguity in portfolio selection
- Title not available (Why is that?)
- Stability analysis of stochastic programs with second order dominance constraints
- Statistical estimation of composite risk functionals and risk optimization problems
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- \(K\)-adaptability in two-stage robust binary programming
- On convergence of kernel learning estimators
- Stochastic optimization methods in finance and energy. New financial products and energy market strategies. Selected papers based on the presentations at the spring school of stochastic programming, Bergamo, Italy, April 10--20, 2007, and the 11th international symposium on stochastic programming (SPXI), Vienna, Austria, August 27--31, 2007
- Distributionally Robust Convex Optimization
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Distributionally robust optimization with matrix moment constraints: Lagrange duality and cutting plane methods
- Convergence analysis for distributionally robust optimization and equilibrium problems
- Quantitative stability analysis for distributionally robust optimization with moment constraints
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Discrete approximation of two-stage stochastic and distributionally robust linear complementarity problems
- Distributionally robust shortfall risk optimization model and its approximation
- From empirical observations to tree models for stochastic optimization: convergence properties
- Stability in stochastic programming with recourse. Contaminated distributions
- Estimated stochastic programs with chance constraints
- Quantitative stability analysis of stochastic quasi-variational inequality problems and applications
- $K$-adaptability in two-stage distributionally robust binary programming
- Minimal representation of insurance prices
- Discrete Approximation and Quantification in Distributionally Robust Optimization
Cited In (18)
- Computationally tractable counterparts of distributionally robust constraints on risk measures
- Multivariate robust second-order stochastic dominance and resulting risk-averse optimization
- Distortion risk measure under parametric ambiguity
- Data-driven distributionally robust risk-averse two-stage stochastic linear programming over Wasserstein ball
- Risk measures under model uncertainty: a Bayesian viewpoint
- Special issue: topics in stochastic programming
- Distributionally robust joint chance-constrained programming with Wasserstein metric
- An equivalent form of minimax distributionally robust optimization problem based on \(\chi^2\)-divergence function
- Variational theory for optimization under stochastic ambiguity
- Convergence analysis for distributionally robust optimization and equilibrium problems
- Quantitative stability analysis for distributionally robust optimization with moment constraints
- Multi-stage distributionally robust convex stochastic optimization with Bayesian-type ambiguity sets
- An equivalent form of minimax distributionally robust optimization problem based on Hellinger-distance divergence function
- Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support
- Stability analysis of optimization problems with \(k\)th order stochastic and distributionally robust dominance constraints induced by full random recourse
- Stackelberg risk preference design
- On linear optimization over Wasserstein balls
- Frameworks and results in distributionally robust optimization
This page was built for publication: Quantitative stability analysis for minimax distributionally robust risk optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118071)