Improvements on removing non-optimal support points in D-optimum design algorithms

29 June 2007

Papers citing "Improvements on removing non-optimal support points in D-optimum design algorithms"

13 / 13 papers shown

Title
Fast Screening Rules for Optimal Design via Quadratic Lasso Reformulation G. Sagnol Luc Pronzato 55 0 0 13 Oct 2023
Optimal Design of Multifactor Experiments via Grid Exploration Radoslav Harman Lenka Filová Samuel Rosa 102 4 0 08 Apr 2021
Removal of the points that do not support an E-optimal experimental design Radoslav Harman Samuel Rosa 39 2 0 02 Aug 2018
A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments Radoslav Harman Lenka Filová Peter Richtárik 102 56 0 17 Jan 2018
Approximate D-optimal Experimental Design with Simultaneous Size and Cost Constraints Radoslav Harman E. Benková 60 2 0 12 Aug 2014
A First-Order Algorithm for the A-Optimal Experimental Design Problem: A Mathematical Programming Approach S. Ahipaşaoğlu 90 14 0 11 Nov 2013
Computing exact $D$ -optimal designs by mixed integer second-order cone programming G. Sagnol Radoslav Harman 174 77 0 18 Jul 2013
Efficient Computational Algorithm for Optimal Allocation in Regression Models Wei Gao P. Chan H. Ng Xiaolei Lu 138 9 0 05 Jan 2013
Computing Optimal Experimental Designs via Interior Point Method Zhaosong Lu Ting Kei Pong 200 1 0 09 Sep 2010
Strict Monotonicity and Convergence Rate of Titterington's Algorithm for Computing D-optimal Designs Yaming Yu 171 18 0 21 Jan 2010
Computing Optimal Designs of multiresponse Experiments reduces to Second-Order Cone Programming G. Sagnol 169 70 0 30 Dec 2009
D-optimal designs via a cocktail algorithm Yaming Yu 200 99 0 31 Oct 2009
Monotonic convergence of a general algorithm for computing optimal designs Yaming Yu 195 126 0 18 May 2009