دانلود مقاله ISI انگلیسی شماره 147698
کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
147698 2018 45 صفحه PDF سفارش دهید 16618 کلمه
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
An algorithm based on semidefinite programming for finding minimax optimal designs
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Computational Statistics & Data Analysis, Volume 119, March 2018, Pages 99-117

پیش نمایش مقاله
پیش نمایش مقاله

چکیده انگلیسی

An algorithm based on a delayed constraint generation method for solving semi-infinite programs for constructing minimax optimal designs for nonlinear models is proposed. The outer optimization level of the minimax optimization problem is solved using a semidefinite programming based approach that requires the design space be discretized. A nonlinear programming solver is then used to solve the inner program to determine the combination of the parameters that yields the worst-case value of the design criterion. The proposed algorithm is applied to find minimax optimal designs for the logistic model, the flexible 4-parameter Hill homoscedastic model and the general nth order consecutive reaction model, and shows that it (i) produces designs that compare well with minimax D−optimal designs obtained from semi-infinite programming method in the literature; (ii) can be applied to semidefinite representable optimality criteria, that include the common A−,E−,G−,I− and D-optimality criteria; (iii) can tackle design problems with arbitrary linear constraints on the weights; and (iv) is fast and relatively easy to use.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.