{"title":"最优控制问题数值解的有效迭代算法","authors":"S. Belbas, I. Mayergoyz","doi":"10.1109/CDC.1984.272046","DOIUrl":null,"url":null,"abstract":"We write discrete Bellman equations and quasi-variational inequalities as fixed-point problems for an appropriate operator T. Under suitable assumptions, we show that either T or a power of T is a contraction.","PeriodicalId":269680,"journal":{"name":"The 23rd IEEE Conference on Decision and Control","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1984-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Efficient iterative algorithms for the numerical solution of optimal control problems\",\"authors\":\"S. Belbas, I. Mayergoyz\",\"doi\":\"10.1109/CDC.1984.272046\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We write discrete Bellman equations and quasi-variational inequalities as fixed-point problems for an appropriate operator T. Under suitable assumptions, we show that either T or a power of T is a contraction.\",\"PeriodicalId\":269680,\"journal\":{\"name\":\"The 23rd IEEE Conference on Decision and Control\",\"volume\":\"47 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1984-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 23rd IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1984.272046\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 23rd IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1984.272046","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Efficient iterative algorithms for the numerical solution of optimal control problems
We write discrete Bellman equations and quasi-variational inequalities as fixed-point problems for an appropriate operator T. Under suitable assumptions, we show that either T or a power of T is a contraction.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
