{"title":"基于非指定值估计的对称Kullback Leibler散度实验设计","authors":"Brijesh Kumar , Mani Bhushan","doi":"10.1016/j.ifacol.2025.07.197","DOIUrl":null,"url":null,"abstract":"<div><div>In this work, we propose a Symmetric Kullback Leibler divergence (SKLD)-based approach for optimal Design of Experiments (DOE) along with estimation of unspecified values in the design of experiments data matrix. Using SKLD as optimality criteria as opposed to various existing alphabetic optimality criteria, facilitates the incorporation of end-user desired performance of estimates. For the case when experimental noise is Gaussian and uncorrelated, the proposed approach results in a Mixed Integer Non-Linear Programming (MINLP) problem. This problem is NP-hard to solve. Hence, a novel heuristic solution strategy is also proposed which solves the proposed problem iteratively and sequentially. In particular, the MINLP problem is split into two sub-problems: (i) Non-Linear Programming (NLP) problem: to estimate optimal unspecified values, and (ii) Non-Linear Integer Programming (IP) problem: to obtain optimal DOE. These two subproblems are solved sequentially and iteratively until convergence is reached. The proposed solution strategy guarantees the decreasing behaviour of SKLD value. The efficacy of the proposed solution strategy is tested on an illustrative example and a Material synthesis problem, and performance is compared with Fedorov exchange algorithm, Forward Greedy search algorithm, and some of the popular MINLP solvers available in GAMS environment. Results demonstrate that the proposed solution approach outperforms most other methods.</div></div>","PeriodicalId":37894,"journal":{"name":"IFAC-PapersOnLine","volume":"59 6","pages":"Pages 510-515"},"PeriodicalIF":0.0000,"publicationDate":"2025-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetric Kullback Leibler divergence-based design of experiments with estimation of unspecified values\",\"authors\":\"Brijesh Kumar , Mani Bhushan\",\"doi\":\"10.1016/j.ifacol.2025.07.197\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this work, we propose a Symmetric Kullback Leibler divergence (SKLD)-based approach for optimal Design of Experiments (DOE) along with estimation of unspecified values in the design of experiments data matrix. Using SKLD as optimality criteria as opposed to various existing alphabetic optimality criteria, facilitates the incorporation of end-user desired performance of estimates. For the case when experimental noise is Gaussian and uncorrelated, the proposed approach results in a Mixed Integer Non-Linear Programming (MINLP) problem. This problem is NP-hard to solve. Hence, a novel heuristic solution strategy is also proposed which solves the proposed problem iteratively and sequentially. In particular, the MINLP problem is split into two sub-problems: (i) Non-Linear Programming (NLP) problem: to estimate optimal unspecified values, and (ii) Non-Linear Integer Programming (IP) problem: to obtain optimal DOE. These two subproblems are solved sequentially and iteratively until convergence is reached. The proposed solution strategy guarantees the decreasing behaviour of SKLD value. The efficacy of the proposed solution strategy is tested on an illustrative example and a Material synthesis problem, and performance is compared with Fedorov exchange algorithm, Forward Greedy search algorithm, and some of the popular MINLP solvers available in GAMS environment. Results demonstrate that the proposed solution approach outperforms most other methods.</div></div>\",\"PeriodicalId\":37894,\"journal\":{\"name\":\"IFAC-PapersOnLine\",\"volume\":\"59 6\",\"pages\":\"Pages 510-515\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2025-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IFAC-PapersOnLine\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2405896325005579\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IFAC-PapersOnLine","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2405896325005579","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
Symmetric Kullback Leibler divergence-based design of experiments with estimation of unspecified values
In this work, we propose a Symmetric Kullback Leibler divergence (SKLD)-based approach for optimal Design of Experiments (DOE) along with estimation of unspecified values in the design of experiments data matrix. Using SKLD as optimality criteria as opposed to various existing alphabetic optimality criteria, facilitates the incorporation of end-user desired performance of estimates. For the case when experimental noise is Gaussian and uncorrelated, the proposed approach results in a Mixed Integer Non-Linear Programming (MINLP) problem. This problem is NP-hard to solve. Hence, a novel heuristic solution strategy is also proposed which solves the proposed problem iteratively and sequentially. In particular, the MINLP problem is split into two sub-problems: (i) Non-Linear Programming (NLP) problem: to estimate optimal unspecified values, and (ii) Non-Linear Integer Programming (IP) problem: to obtain optimal DOE. These two subproblems are solved sequentially and iteratively until convergence is reached. The proposed solution strategy guarantees the decreasing behaviour of SKLD value. The efficacy of the proposed solution strategy is tested on an illustrative example and a Material synthesis problem, and performance is compared with Fedorov exchange algorithm, Forward Greedy search algorithm, and some of the popular MINLP solvers available in GAMS environment. Results demonstrate that the proposed solution approach outperforms most other methods.
期刊介绍:
All papers from IFAC meetings are published, in partnership with Elsevier, the IFAC Publisher, in theIFAC-PapersOnLine proceedings series hosted at the ScienceDirect web service. This series includes papers previously published in the IFAC website.The main features of the IFAC-PapersOnLine series are: -Online archive including papers from IFAC Symposia, Congresses, Conferences, and most Workshops. -All papers accepted at the meeting are published in PDF format - searchable and citable. -All papers published on the web site can be cited using the IFAC PapersOnLine ISSN and the individual paper DOI (Digital Object Identifier). The site is Open Access in nature - no charge is made to individuals for reading or downloading. Copyright of all papers belongs to IFAC and must be referenced if derivative journal papers are produced from the conference papers. All papers published in IFAC-PapersOnLine have undergone a peer review selection process according to the IFAC rules.