A SMOOTHING PENALIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC PROGRAMS WITH SECOND-ORDER STOCHASTIC DOMINANCE CONSTRAINTS
From MaRDI portal
Publication:2846481
DOI10.1142/S0217595913400022zbMath1273.90139OpenAlexW2105055176MaRDI QIDQ2846481
Yong Wang, Huifu Xu, Hailin Sun
Publication date: 5 September 2013
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595913400022
Related Items (5)
A smoothing SAA algorithm for a portfolio choice model based on second-order stochastic dominance measures ⋮ An incremental bundle method for portfolio selection problem under second-order stochastic dominance ⋮ Portfolio optimization with relaxation of stochastic second order dominance constraints via conditional value at risk ⋮ A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation ⋮ Data-driven stochastic programming with distributionally robust constraints under Wasserstein distance: asymptotic properties
Cites Work
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
- Sample average approximation of stochastic dominance constrained programs
- Processing second-order stochastic dominance models using cutting-plane representations
- Uniform exponential convergence of sample average random functions under general sampling with applications in stochastic programming
- Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications
- Optimality and duality theory for stochastic optimization problems with nonlinear dominance constraints
- A parametric view on the Mangasarian-Fromovitz constraint qualification
- From stochastic dominance to mean-risk models: Semideviations as risk measures
- Differentiability and semismoothness properties of integral functions and their applications
- New variants of bundle methods
- Implicit smoothing and its application to optimization with piecewise smooth equality constraints
- The Cutting-Plane Method for Solving Convex Programs
- Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods
- Stochastic mathematical programs with equilibrium constraints, modelling and sample average approximation
- On Rates of Convergence for Stochastic Optimization Problems Under Non–Independent and Identically Distributed Sampling
- Optimization and nonsmooth analysis
- Optimization with Stochastic Dominance Constraints
- Analysis of Sample-Path Optimization
- Level function method for quasiconvex programming.
This page was built for publication: A SMOOTHING PENALIZED SAMPLE AVERAGE APPROXIMATION METHOD FOR STOCHASTIC PROGRAMS WITH SECOND-ORDER STOCHASTIC DOMINANCE CONSTRAINTS
