Linearization methods for optimization of functionals which depend on probability measures
From MaRDI portal
Recommendations
- A method to find the minimax of functionals dependent on probability measures
- Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring
- Regularization methods for optimization problems with probabilistic constraints
- Dual methods for probabilistic optimization problems.
- Stochastic Optimization Problems with Incomplete Information on Distribution Functions
Cited in
(14)- Minimum bias designs with constraints
- An algorithm based on semidefinite programming for finding minimax optimal designs
- Adaptive grid semidefinite programming for finding optimal designs
- Component-wise dimension reduction
- Optimal experimental design for linear time invariant state-space models
- Stochastic programming with incomplete information:a surrey of results on postoptimization and sensitivity analysis
- Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring
- scientific article; zbMATH DE number 1083124 (Why is no real title available?)
- Optimisation in space of measures and optimal design
- Systemic risk and security management
- Invited Discussion Paper Constrained Optimization of Experimental Design
- Optimal Design of Experiments for Implicit Models
- Probability-of-failure-based optimization for random PDEs through concentration-of-measure inequalities
- Optimal and suboptimal solutions to stochastically uncertain problems of quintile optimization
This page was built for publication: Linearization methods for optimization of functionals which depend on probability measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3730351)
