K-Optimal Design via Semidefinite Programming and Entropy Optimization

DOI10.1287/moor.2014.0682zbMath1346.90685OpenAlexW4298218231MaRDI QIDQ5252232

Julie Zhou, Pierre Maréchal, Jane J. Ye

Publication date: 29 May 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.2014.0682

zbMATH Keywords

semidefinite optimizationcondition numbersFenchel dualityentropy optimizationoptimal design of experimentsChebyshef polynomials

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (1)

K-optimal designs for parameters of shifted Ornstein-Uhlenbeck processes and sheets

Cites Work

• Unnamed Item
• Multiplicative algorithms for computing optimum designs
• D-optimal minimax regression designs on discrete design space
• Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
• Monotonic convergence of a general algorithm for computing optimal designs
• Partially finite convex programming. I: Quasi relative interiors and duality theory
• Bayesian experimental design: A review
• Integrals which are convex functionals
• Integrals which are convex functionals. II
• Minimizing the Condition Number of a Gram Matrix
• Minimizing Condition Number via Convex Programming
• Optimizing Condition Numbers
• Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
• Optimal Designs for Rational Function Regression
• Minimizing the Condition Number to Construct Design Points for Polynomial Regression Models
• Computing Optimal Experimental Designs via Interior Point Method
• On Information and Sufficiency

This page was built for publication: K-Optimal Design via Semidefinite Programming and Entropy Optimization