Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
From MaRDI portal
Publication:460659
DOI10.1016/J.JSPI.2014.04.005zbMATH Open1297.62175OpenAlexW2027349279MaRDI QIDQ460659FDOQ460659
Authors: Luc Pronzato, A. Zhigljavsky 
Publication date: 13 October 2014
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jspi.2014.04.005
Recommendations
- Efficient computational algorithm for optimal continuous experimental designs
- Using a generalized \(\Delta^2\)-distribution for constructing exact \(D\)-optimal designs
- Computing the minimal efficiency of designs by a differentiable approximation of \(\Phi _{E_k}\)-optimal\-ity criteria
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- Algorithms for optimal design with application to multiple polynomial regression
Optimal statistical designs (62K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- D-optimal designs via a cocktail algorithm
- A vertex-exchange-method in D-optimal design theory
- Convergent design sequences, for sufficiently regular optimality criteria
- Some algorithmic aspects of the theory of optimal designs
- Introductory lectures on convex optimization. A basic course.
- Strict monotonicity and convergence rate of Titterington's algorithm for computing D-optimal designs
- The Equivalence of Two Extremum Problems
- An algorithm for optimal designs on a design space
- Title not available (Why is that?)
- Improvements on removing nonoptimal support points in \(D\)-optimum design algorithms
- Improving updating rules in multiplicative algorithms for computing \(D\)-optimal designs
- Monotonic convergence of a general algorithm for computing optimal designs
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Title not available (Why is that?)
- Numerical estimation of a probability measure
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Sequential Generation of $D$-Optimum Experimental Designs
- Optimum designs for multi-factor models
- Title not available (Why is that?)
- The Cutting-Plane Method for Solving Convex Programs
- Equivalence Theorems and Cutting Plane Algorithms for a Class of Experimental Design Problems
- On the de la Garza phenomenon
- An approach to nonlinear programming
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- A note on the de la Garza phenomenon for locally optimal designs
- Title not available (Why is that?)
- On the invariance principle for sums of independent identically distributed random variables
- A vertex ranking algorithm for the fixed-charge transportation problem
- Title not available (Why is that?)
- The Gradient Projection Method under Mild Differentiability Conditions
- Support points of locally optimal designs for nonlinear models with two parameters
- D-Optimality for Regression Designs: A Review
- Optimal Experimental Designs
- Sequences converging to D-optimal designs of experiments
- Some iterative procedures for generating nonsingular optimal designs
- A delimitation of the support of optimal designs for Kiefer's \(\phi _p\)-class of criteria
- Approximate D-optimal designs of experiments on the convex hull of a finite set of information matrices
- Design of experiments in nonlinear models. Asymptotic normality, optimality criteria and small-sample properties
- Geometry of \(E\)-optimality
- W-iterations and ripples therefrom
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variational calculus in the space of measures and optimal design
Cited In (13)
- Bayesian quadrature, energy minimization, and space-filling design
- Removing inessential points in \(c\)-and \(A\)-optimal design
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming
- Adaptive grid semidefinite programming for finding optimal designs
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion
- Quasi-Newton algorithm for optimal approximate linear regression design: optimization in matrix space
- Optimal designs for mixed continuous and binary responses with quantitative and qualitative factors
- Mixed-integer linear programming for computing optimal experimental designs
- A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments
- Optimal experimental design for linear time invariant state-space models
- Optimal design of multifactor experiments via grid exploration
- Ascent with quadratic assistance for the construction of exact experimental designs
- Efficient computational algorithm for optimal continuous experimental designs
This page was built for publication: Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q460659)
