Distributionally robust second-order stochastic dominance constrained optimization with Wasserstein ball
From MaRDI portal
(Redirected from Publication:5080499)
Abstract: We consider a distributionally robust second-order stochastic dominance constrained optimization problem. We require the dominance constraints hold with respect to all probability distributions in a Wasserstein ball centered at the empirical distribution. We adopt the sample approximation approach to develop a linear programming formulation that provides a lower bound. We propose a novel split-and-dual decomposition framework which provides an upper bound. We establish quantitative convergency for both lower and upper approximations given some constraint qualification conditions. To efficiently solve the non-convex upper bound problem, we use a sequential convex approximation algorithm. Numerical evidences on a portfolio selection problem valid the convergency and effectiveness of the proposed two approximation methods.
Recommendations
- Stochastic optimization problems with second order stochastic dominance constraints via Wasserstein metric.
- Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Sample average approximation of stochastic dominance constrained programs
- Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
Cites work
- A cutting-surface method for uncertain linear programs with polyhedral stochastic dominance constraints
- A note on second-order stochastic dominance constraints induced by mixed-integer linear recourse
- Ambiguity in risk preferences in robust stochastic optimization
- An Application of Error Bounds for Convex Programming in a Linear Space
- An approximation scheme for stochastic programs with second order dominance constraints
- Data-driven chance constrained stochastic program
- Data-driven distributionally robust chance-constrained optimization with Wasserstein metric
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- Data-driven risk-averse stochastic optimization with Wasserstein metric
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
- Decomposition and discrete approximation methods for solving two-stage distributionally robust optimization problems
- Distributionally Robust Chance Constrained Geometric Optimization
- Distributionally robust joint chance constraints with second-order moment information
- Duality between coherent risk measures and stochastic dominance constraints in risk-averse optimization
- Exact penalization, level function method, and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints
- scientific article; zbMATH DE number 3134565 (Why is no real title available?)
- Lectures on Stochastic Programming
- Multivariate robust second-order stochastic dominance and resulting risk-averse optimization
- New Formulations for Optimization under Stochastic Dominance Constraints
- On distributionally robust chance constrained programs with Wasserstein distance
- On distributionally robust optimization problems with \(k\)-th order stochastic dominance constraints induced by full random quadratic recourse
- On time stochastic dominance induced by mixed integer-linear recourse in multistage stochastic programs
- Optimality conditions for bilevel programming problems
- Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
- Optimization with reference-based robust preference constraints
- Optimization with Stochastic Dominance Constraints
- Optimization with stochastic preferences based on a general class of scalarization functions
- Portfolio diversification based on stochastic dominance under incomplete probability information
- Primal-dual algorithms for optimization with stochastic dominance
- Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
- Processing second-order stochastic dominance models using cutting-plane representations
- Rectangular chance constrained geometric optimization
- Relaxations of linear programming problems with first order stochastic dominance constraints
- Robust stochastic dominance and its application to risk-averse optimization
- Robustness of optimal portfolios under risk and stochastic dominance constraints
- Stability analysis of optimization problems with \(k\)th order stochastic and distributionally robust dominance constraints induced by full random recourse
- Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints
- Stability and sensitivity of stochastic dominance constrained optimization models
- Stochastic Programs with First-Order Dominance Constraints Induced by Mixed-Integer Linear Recourse
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Variational Analysis
Cited in
(10)- Frameworks and results in distributionally robust optimization
- Stochastic optimization problems with second order stochastic dominance constraints via Wasserstein metric.
- Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
- Distributionally robust portfolio optimization with second-order stochastic dominance based on Wasserstein metric
- Distributionally robust optimization with multivariate second-order stochastic dominance constraints with applications in portfolio optimization
- Data-driven optimization with distributionally robust second order stochastic dominance constraints
- The sparse portfolio optimization with stochastic dominance and background risk and the slqpso algorithm
- Measures of stochastic non-dominance in portfolio optimization
- A smoothing algorithm for two-stage portfolio model with second-order stochastic dominance constraints
- Portfolio optimization with robust stochastic dominance testing: a genetic algorithm approach
This page was built for publication: Distributionally robust second-order stochastic dominance constrained optimization with Wasserstein ball
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5080499)