An Algorithm for Construction of Constrained D-Optimum Designs

DOI10.1007/978-3-319-13881-7_51zbMath1349.62349OpenAlexW340470818MaRDI QIDQ2833401

Dariusz Uciński

Publication date: 18 November 2016

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13881-7_51

Mathematics Subject Classification ID

Related Items (5)

An algorithm based on semidefinite programming for finding minimax optimal designs ⋮ Goal-oriented optimal design of experiments for large-scale Bayesian linear inverse problems ⋮ Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion ⋮ Efficient D-Optimal Design of Experiments for Infinite-Dimensional Bayesian Linear Inverse Problems ⋮ A branch-and-bound algorithm for the exact optimal experimental design problem

Cites Work

• D-optimal design of a monitoring network for parameter estimation of distributed systems
• Sensor network scheduling for identification of spatially distributed processes
• Optimal Measurement Methods for Distributed Parameter System Identification
• Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
• Invited Discussion Paper Constrained Optimization of Experimental Design
• A Note on Optimal Bounded Designs
• Distributed scheduling of sensor networks for identification of spatio-temporal processes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An Algorithm for Construction of Constrained D-Optimum Designs