{"title":"构造逼近Lipschitz函数的单步最优随机算法","authors":"M.A. Kokorev","doi":"10.1016/0041-5553(90)90184-T","DOIUrl":null,"url":null,"abstract":"<div><p>The problem of approximating a function satisfying a Lipschitz condition in the interval [<em>a</em>, <em>b</em>] is considered. A single-step optimal stochastic algorithm for selecting the data points is constructed.</p></div>","PeriodicalId":101271,"journal":{"name":"USSR Computational Mathematics and Mathematical Physics","volume":"30 3","pages":"Pages 8-15"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0041-5553(90)90184-T","citationCount":"0","resultStr":"{\"title\":\"Construction of a single-step optimal stochastic algorithm for approximating a Lipschitz function\",\"authors\":\"M.A. Kokorev\",\"doi\":\"10.1016/0041-5553(90)90184-T\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The problem of approximating a function satisfying a Lipschitz condition in the interval [<em>a</em>, <em>b</em>] is considered. A single-step optimal stochastic algorithm for selecting the data points is constructed.</p></div>\",\"PeriodicalId\":101271,\"journal\":{\"name\":\"USSR Computational Mathematics and Mathematical Physics\",\"volume\":\"30 3\",\"pages\":\"Pages 8-15\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0041-5553(90)90184-T\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"USSR Computational Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/004155539090184T\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"USSR Computational Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/004155539090184T","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Construction of a single-step optimal stochastic algorithm for approximating a Lipschitz function
The problem of approximating a function satisfying a Lipschitz condition in the interval [a, b] is considered. A single-step optimal stochastic algorithm for selecting the data points is constructed.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
