Primal-Dual Algorithms for Optimization with Stochastic Dominance
From MaRDI portal
Publication:2954172
DOI10.1137/141001251zbMath1453.90107OpenAlexW2568756996MaRDI QIDQ2954172
Z. Max Shen, J. George Shanthikumar, William B. Haskell
Publication date: 12 January 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/141001251
Related Items (3)
The CoMirror algorithm with random constraint sampling for convex semi-infinite programming ⋮ Distributionally Robust Second-Order Stochastic Dominance Constrained Optimization with Wasserstein Ball ⋮ An inexact primal-dual algorithm for semi-infinite programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ambiguity in risk preferences in robust stochastic optimization
- Optimization with a class of multivariate integral stochastic order constraints
- Sample average approximation of stochastic dominance constrained programs
- Robust stochastic dominance and its application to risk-averse optimization
- Optimization with multivariate stochastic dominance constraints
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- Asymptotically efficient adaptive allocation rules
- Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
- Data-driven robust optimization
- Aspects of optimization with stochastic dominance
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Constructing Uncertainty Sets for Robust Linear Optimization
- Uncertainties in minimax stochastic programs
- Robust and Stochastically Weighted Multiobjective Optimization Models and Reformulations
- Online Learning and Online Convex Optimization
- Stochastic Dynamic Optimization with Discounted Stochastic Dominance Constraints
- A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints
- Optimization with Stochastic Dominance Constraints
- Stochastic Dominance-Constrained Markov Decision Processes
- A Convex Analytic Approach to Risk-Aware Markov Decision Processes
- Logarithmic Regret Algorithms for Online Convex Optimization
- Lectures on Choquet's theorem
This page was built for publication: Primal-Dual Algorithms for Optimization with Stochastic Dominance