Computation of efficient solutions of discretely distributed stochastic optimization problems
From MaRDI portal
Recommendations
- On solution of stochastic linear programs by discretization methods
- scientific article; zbMATH DE number 3860894
- A Separable Piecewise Linear Upper Bound for Stochastic Linear Programs
- scientific article; zbMATH DE number 3894839
- Computation of Descent Directions in Stochastic Optimization Problems with Invariant Distributions
- Reduced gradient method for stochastic optimization problem with nonlinear constraints
- scientific article; zbMATH DE number 6514925
- scientific article; zbMATH DE number 4062822
- Newton-type methods for stochastic programming.
- Preprocessing in Stochastic Programming: The Case of Linear Programs
Cites work
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 3852235 (Why is no real title available?)
- scientific article; zbMATH DE number 3827006 (Why is no real title available?)
- scientific article; zbMATH DE number 3690528 (Why is no real title available?)
- scientific article; zbMATH DE number 193918 (Why is no real title available?)
- Descent directions and efficient solutions in discretely distributed stochastic programs
- Methods of statistical linearization (survey)
- On L1 and Chebyshev estimation
- On a Theorem of Hardy, Littlewood, Polya, and Blackwell
- Theory of multiobjective optimization
Cited in
(4)
This page was built for publication: Computation of efficient solutions of discretely distributed stochastic optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4009795)