Pages that link to "Item:Q2561455"

The following pages link to Sequences converging to D-optimal designs of experiments (Q2561455):

Displayed 36 items.

• Efficient computational algorithm for optimal allocation in regression models (Q390453) ‎ (← links)
• Algorithmic construction of optimal designs on compact sets for concave and differentiable criteria (Q460659) ‎ (← links)
• Combined algorithm to compute D-optimal designs (Q475667) ‎ (← links)
• Some refinements on Fedorov's algorithms for constructing D-optimal designs (Q481423) ‎ (← links)
• Qualitative and quantitative experiment design for phenomenological models - a survey (Q916278) ‎ (← links)
• Monotonic convergence of a general algorithm for computing optimal designs (Q973880) ‎ (← links)
• Numerical estimation of a probability measure (Q1063353) ‎ (← links)
• Sequential generation of D-optimal input designs for linear dynamic systems (Q1142518) ‎ (← links)
• On linear regression designs which maximize information (Q1157861) ‎ (← links)
• Minimum-volume ellipsoids containing compact sets: Application to parameter bounding (Q1345621) ‎ (← links)
• Optimal design with bounded density: Optimization algorithms of the exchange type (Q1824325) ‎ (← links)
• A review of reliable maximum likelihood algorithms for semiparametric mixture models (Q1901749) ‎ (← links)
• A branch-and-bound algorithm for the exact optimal experimental design problem (Q2058883) ‎ (← links)
• Optimal design of multifactor experiments via grid exploration (Q2058892) ‎ (← links)
• Performance analysis of greedy algorithms for minimising a maximum mean discrepancy (Q2104022) ‎ (← links)
• A sparse control approach to optimal sensor placement in PDE-constrained parameter estimation problems (Q2334623) ‎ (← links)
• Fast algorithms for the minimum volume estimator (Q2349524) ‎ (← links)
• Exact optimal experimental designs with constraints (Q2361462) ‎ (← links)
• On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids (Q2381536) ‎ (← links)
• Submodularity and Randomized rounding techniques for Optimal Experimental Design (Q2883636) ‎ (← links)
• Remarks on Communications in Statistics—Theory and Methods, Vol. 39, No. 15 (2010), pp. 2818–2828 (Q2884910) ‎ (← links)
• Optimal design for population pk/pd models (Q2913241) ‎ (← links)
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) ‎ (← links)
• (Q4042546) ‎ (← links)
• An introduction to designh optimality with an overview of the literature (Q4171460) ‎ (← links)
• Some extremal problems in designing discriminating experiments (Q4176860) ‎ (← links)
• Some iterative procedures for generating nonsingular optimal designs (Q4184123) ‎ (← links)
• On a class of algorithms from experimental design theory (Q4327907) ‎ (← links)
• A comparison of design alternatives for generalized linear models (Q4383750) ‎ (← links)
• Optimisation in space of measures and optimal design (Q4452118) ‎ (← links)
• On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) ‎ (← links)
• Invited Discussion Paper Constrained Optimization of Experimental Design (Q4763482) ‎ (← links)
• Variational Calculus in the Space of Measures and Optimal Design (Q5233879) ‎ (← links)
• Linear convergence of a modified Frank–Wolfe algorithm for computing minimum-volume enclosing ellipsoids (Q5459815) ‎ (← links)
• A first-order algorithm for the A-optimal experimental design problem: a mathematical programming approach (Q5963815) ‎ (← links)
• Computing minimum-volume enclosing ellipsoids (Q6062882) ‎ (← links)