Second-Order Lower Bounds on the Expectation of a Convex Function
From MaRDI portal
(Redirected from Publication:5704243)
Recommendations
- New Second-Order Bounds on the Expectation of Saddle Functions with Applications to Stochastic Linear Programming
- Bounds for Two-Stage Stochastic Programs with Fixed Recourse
- Tight Bounds for Stochastic Convex Programs
- An upper bound for SLP using first and total second moments
- A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions
Cited in
(15)- Third-order extensions of Lo's semiparametric bound for European call options
- An iterative algorithm to bound partial moments
- Robust two-stage stochastic linear optimization with risk aversion
- An upper bound on the expected value of a non-increasing convex function with convex marginal return functions
- Problem-based optimal scenario generation and reduction in stochastic programming
- Bound-based decision rules in multistage stochastic programming
- A Tchebysheff-Type Bound on the Expectation of Sublinear Polyhedral Functions
- Tight Bounds for Stochastic Convex Programs
- Upper Bounds on the Expected Value of a Convex Function Using Gradient and Conjugate Function Information
- New Second-Order Bounds on the Expectation of Saddle Functions with Applications to Stochastic Linear Programming
- Guaranteed bounds for general nondiscrete multistage risk-averse stochastic optimization programs
- A scalable bounding method for multistage stochastic programs
- On the safe side of stochastic programming: bounds and approximations
- Distributionally robust optimization
- Second-order bounds for the M/M/s queue with random arrival rate
This page was built for publication: Second-Order Lower Bounds on the Expectation of a Convex Function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704243)
