Numerical minimization methods for convex functionals dependent on probability measures with applications to optimal pollution monitoring
From MaRDI portal
Publication:4007328
DOI10.1007/BF01070369zbMath0754.65060MaRDI QIDQ4007328
Publication date: 27 September 1992
Published in: Cybernetics (Search for Journal in Brave)
stochastic programming; convex programming; gradient projection method; convex functionals; optimal experiment design; optimal parameter estimation; air pollution monitoring
62K05: Optimal statistical designs
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C15: Stochastic programming
92E20: Classical flows, reactions, etc. in chemistry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensors and controllers location in distributed systems - A survey
- Stochastic approximation methods for constrained and unconstrained systems
- Optimum Designs in Regression Problems
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Linearization methods for optimization of functionals which depend on probability measures
- Sufficient conditions for extremum, penalty functions and regularity