{"title":"约束经济调度控制问题并行纹理算法的精确收敛定理","authors":"Garng M. Huang, S. Hsieh","doi":"10.23919/ACC.1993.4793243","DOIUrl":null,"url":null,"abstract":"A parallel textured algorithm, the sufficient conditions for the algorithm to converge to its true solution and its proof are described in our earlier papers [1]-[2]. In this paper, we provide some examples to illustrate the basic ideas behind the exact convergence conditions, and show when they will be violated and how the violations impact on the convergence.","PeriodicalId":162700,"journal":{"name":"1993 American Control Conference","volume":"80 6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Some Examples to Illustrate The Exact Convergence Theorem of A Parallel Textured Algorithm for Constrained Economic Dispatch Control Problems\",\"authors\":\"Garng M. Huang, S. Hsieh\",\"doi\":\"10.23919/ACC.1993.4793243\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A parallel textured algorithm, the sufficient conditions for the algorithm to converge to its true solution and its proof are described in our earlier papers [1]-[2]. In this paper, we provide some examples to illustrate the basic ideas behind the exact convergence conditions, and show when they will be violated and how the violations impact on the convergence.\",\"PeriodicalId\":162700,\"journal\":{\"name\":\"1993 American Control Conference\",\"volume\":\"80 6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-06-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 American Control Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.23919/ACC.1993.4793243\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 American Control Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/ACC.1993.4793243","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Some Examples to Illustrate The Exact Convergence Theorem of A Parallel Textured Algorithm for Constrained Economic Dispatch Control Problems
A parallel textured algorithm, the sufficient conditions for the algorithm to converge to its true solution and its proof are described in our earlier papers [1]-[2]. In this paper, we provide some examples to illustrate the basic ideas behind the exact convergence conditions, and show when they will be violated and how the violations impact on the convergence.