{"title":"非线性ae解集逼近的分支与剪枝算法","authors":"A. Goldsztejn","doi":"10.1145/1141277.1141665","DOIUrl":null,"url":null,"abstract":"Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situations. A new branch and prune algorithm dedicated to the approximation of non-linear AE-solution sets is proposed. It is based on a new generalized interval (intervals whose bounds are not constrained to be ordered) parametric Hansen-Sengupta operator. In spite of some restrictions on the form of the AE-solution set which can be approximated, it allows to solve problems which were before out of reach of previous numerical methods. Some promising experimentations are presented.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":"{\"title\":\"A branch and prune algorithm for the approximation of non-linear AE-solution sets\",\"authors\":\"A. Goldsztejn\",\"doi\":\"10.1145/1141277.1141665\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situations. A new branch and prune algorithm dedicated to the approximation of non-linear AE-solution sets is proposed. It is based on a new generalized interval (intervals whose bounds are not constrained to be ordered) parametric Hansen-Sengupta operator. In spite of some restrictions on the form of the AE-solution set which can be approximated, it allows to solve problems which were before out of reach of previous numerical methods. Some promising experimentations are presented.\",\"PeriodicalId\":269830,\"journal\":{\"name\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"28\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2006 ACM symposium on Applied computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1141277.1141665\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2006 ACM symposium on Applied computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1141277.1141665","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A branch and prune algorithm for the approximation of non-linear AE-solution sets
Non-linear AE-solution sets are a special case of parametric systems of equations where universally quantified parameters appear first. They allow to model many practical situations. A new branch and prune algorithm dedicated to the approximation of non-linear AE-solution sets is proposed. It is based on a new generalized interval (intervals whose bounds are not constrained to be ordered) parametric Hansen-Sengupta operator. In spite of some restrictions on the form of the AE-solution set which can be approximated, it allows to solve problems which were before out of reach of previous numerical methods. Some promising experimentations are presented.