An approximation scheme for stochastic programs with second order dominance constraints
From MaRDI portal
Recommendations
- Sample average approximation of stochastic dominance constrained programs
- Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
- Convergence analysis of stationary points in sample average approximation of stochastic programs with second order stochastic dominance constraints
- Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
- A smoothing penalized sample average approximation method for stochastic programs with second-order stochastic dominance constraints
Cites work
- scientific article; zbMATH DE number 3943574 (Why is no real title available?)
- scientific article; zbMATH DE number 4037624 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1857850 (Why is no real title available?)
- scientific article; zbMATH DE number 2121076 (Why is no real title available?)
- A cutting-surface method for uncertain linear programs with polyhedral stochastic dominance constraints
- Analysis of Sample-Path Optimization
- Approximation to Optimization Problems: An Elementary Review
- Convergence of stationary points of sample average two-stage stochastic programs: a generalized equation approach
- Entropic approximation for mathematical programs with robust equilibrium constraints
- Entropic risk measures: coherence vs. convexity, model ambiguity and robust large deviations
- Error bounds for infinite systems of convex inequalities without Slater's condition
- Exact penalization, level function method, and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints
- Integrals of set-valued functions
- On solving simple bilevel programs with a nonconvex lower level program
- Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
- Optimization and nonsmooth analysis
- Optimization with Stochastic Dominance Constraints
- Processing second-order stochastic dominance models using cutting-plane representations
- Quantitative stability analysis of stochastic generalized equations
- Sample average approximation method for compound stochastic optimization problems
- Sample average approximation of stochastic dominance constrained programs
- Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
- Smoothing methods for nonsmooth, nonconvex minimization
- Stability analysis of stochastic programs with second order dominance constraints
- Stability and Sensitivity of Optimization Problems with First Order Stochastic Dominance Constraints
- Stability and sensitivity of stochastic dominance constrained optimization models
- Stability in Two-Stage Stochastic Programming
- Stochastic Dominance and Expected Utility: Survey and Analysis
- Uncertain convex programs: randomized solutions and confidence levels
- Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
- Uniform laws of large numbers for set-valued mappings and subdifferentials of random functions
- Variational Analysis
Cited in
(9)- Distributionally robust optimization with multivariate second-order stochastic dominance constraints with applications in portfolio optimization
- Empirical estimates in stochastic programs with probability and second order stochastic dominance constraints
- Sample average approximation of stochastic dominance constrained programs
- Distributionally robust second-order stochastic dominance constrained optimization with Wasserstein ball
- Stability analysis of stochastic programs with second order dominance constraints
- ALM models based on second order stochastic dominance
- Probability approximation schemes for stochastic programs with distributionally robust second-order dominance constraints
- A smoothing penalized sample average approximation method for stochastic programs with second-order stochastic dominance constraints
- Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
This page was built for publication: An approximation scheme for stochastic programs with second order dominance constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501509)