Probability Gradient Estimation by Set-Valued Calculus and Applications in Network Design
From MaRDI portal
Recommendations
Cited in
(18)- Generalized differentiation of probability functions: parameter dependent sets given by intersections of convex sets and complements of convex sets
- Derivatives of Markov Kernels and Their Jordan Decomposition
- (Sub-)differentiability of probability functions with elliptical distributions
- Gradient formulae for nonlinear probabilistic constraints with non-convex quadratic forms
- Smooth Approximation of the Quantile Function Derivatives
- Importance sampling for option Greeks with discontinuous payoffs
- Approximating inequality systems within probability functions: studying implications for problems and consistency of first-order information
- Gradient-based simulation optimization under probability constraints
- Subdifferential characterization of probability functions under Gaussian distribution
- Small perturbations of polytopes
- Probability functions, differentiability, arbitrary laws and mixtures of ellipticals
- Probability maximization via Minkowski functionals: convex representations and tractable resolution
- An empirical quantile estimation approach for chance-constrained nonlinear optimization problems
- Derivatives of probability functions: unions of polyhedra and elliptical distributions
- Generalized differentiation of probability functions acting on an infinite system of constraints
- Application of the smooth approximation of the probability function in some applied stochastic programming problems
- (Sub-)gradient formulae for probability functions of random inequality systems under Gaussian distribution
- A gradient formula for linear chance constraints under Gaussian distribution
This page was built for publication: Probability Gradient Estimation by Set-Valued Calculus and Applications in Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317527)
