Export Ready — 

Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming

Bibliographic Details
Main Author: Duarte, Belmiro P. M.
Publication Date: 2023
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: https://hdl.handle.net/10316/113975
https://doi.org/10.3390/math11040854
Summary: The systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming, when the covariates are categorical variables, is still scarce. We propose mixed-integer semidefinite programming formulations, to find exact D-, A- and I-optimal designs for linear models, and locally optimal designs for nonlinear models when the design domain is a finite set of points. The strategy requires: (i) the generation of a set of candidate treatments; (ii) the formulation of the optimal design problem as a mixed-integer semidefinite program; and (iii) its solution, employing appropriate solvers. For comparison, we use semidefinite programming-based formulations to find equivalent approximate optimal designs. We demonstrate the application of the algorithm with various models, considering both unconstrained and constrained setups. Equivalent approximate optimal designs are used for comparison.
id RCAP_8d859e2daf22d0b8700339ff00448952
oai_identifier_str oai:estudogeral.uc.pt:10316/113975
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programmingfactorial experimentsexact designsmixed-integer semidefinite programmingmodel-based optimal designsThe systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming, when the covariates are categorical variables, is still scarce. We propose mixed-integer semidefinite programming formulations, to find exact D-, A- and I-optimal designs for linear models, and locally optimal designs for nonlinear models when the design domain is a finite set of points. The strategy requires: (i) the generation of a set of candidate treatments; (ii) the formulation of the optimal design problem as a mixed-integer semidefinite program; and (iii) its solution, employing appropriate solvers. For comparison, we use semidefinite programming-based formulations to find equivalent approximate optimal designs. We demonstrate the application of the algorithm with various models, considering both unconstrained and constrained setups. Equivalent approximate optimal designs are used for comparison.MDPI2023info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttps://hdl.handle.net/10316/113975https://hdl.handle.net/10316/113975https://doi.org/10.3390/math11040854eng2227-7390Duarte, Belmiro P. M.info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-03-13T11:26:06Zoai:estudogeral.uc.pt:10316/113975Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-29T06:06:49.739934Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
title Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
spellingShingle Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
Duarte, Belmiro P. M.
factorial experiments
exact designs
mixed-integer semidefinite programming
model-based optimal designs
title_short Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
title_full Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
title_fullStr Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
title_full_unstemmed Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
title_sort Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
author Duarte, Belmiro P. M.
author_facet Duarte, Belmiro P. M.
author_role author
dc.contributor.author.fl_str_mv Duarte, Belmiro P. M.
dc.subject.por.fl_str_mv factorial experiments
exact designs
mixed-integer semidefinite programming
model-based optimal designs
topic factorial experiments
exact designs
mixed-integer semidefinite programming
model-based optimal designs
description The systematic design of exact optimal designs of experiments is typically challenging, as it results in nonconvex optimization problems. The literature on the computation of model-based exact optimal designs of experiments via mathematical programming, when the covariates are categorical variables, is still scarce. We propose mixed-integer semidefinite programming formulations, to find exact D-, A- and I-optimal designs for linear models, and locally optimal designs for nonlinear models when the design domain is a finite set of points. The strategy requires: (i) the generation of a set of candidate treatments; (ii) the formulation of the optimal design problem as a mixed-integer semidefinite program; and (iii) its solution, employing appropriate solvers. For comparison, we use semidefinite programming-based formulations to find equivalent approximate optimal designs. We demonstrate the application of the algorithm with various models, considering both unconstrained and constrained setups. Equivalent approximate optimal designs are used for comparison.
publishDate 2023
dc.date.none.fl_str_mv 2023
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv https://hdl.handle.net/10316/113975
https://hdl.handle.net/10316/113975
https://doi.org/10.3390/math11040854
url https://hdl.handle.net/10316/113975
https://doi.org/10.3390/math11040854
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 2227-7390
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv MDPI
publisher.none.fl_str_mv MDPI
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833602580352073728