{"title":"用二次规划构造光滑样条","authors":"N. Budkina","doi":"10.3176/phys.math.2000.1.03","DOIUrl":null,"url":null,"abstract":". The problem of minimization of a smoothing functional under inequality constraints, which has a solution in the form of a natural spline, is reduced to the problem of quadratic programming with a positive semidefinite matrix. Using the results of quadratic programming, we obtain the modified simplex method for the solution of this problem by adding—-removing interpolating knots of a spline.","PeriodicalId":308961,"journal":{"name":"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"ON THE CONSTRUCTION OF SMOOTHING SPLINES BY QUADRATIC PROGRAMMING\",\"authors\":\"N. Budkina\",\"doi\":\"10.3176/phys.math.2000.1.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\". The problem of minimization of a smoothing functional under inequality constraints, which has a solution in the form of a natural spline, is reduced to the problem of quadratic programming with a positive semidefinite matrix. Using the results of quadratic programming, we obtain the modified simplex method for the solution of this problem by adding—-removing interpolating knots of a spline.\",\"PeriodicalId\":308961,\"journal\":{\"name\":\"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Estonian Academy of Sciences. Physics. Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3176/phys.math.2000.1.03\",\"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 Estonian Academy of Sciences. Physics. Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3176/phys.math.2000.1.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ON THE CONSTRUCTION OF SMOOTHING SPLINES BY QUADRATIC PROGRAMMING
. The problem of minimization of a smoothing functional under inequality constraints, which has a solution in the form of a natural spline, is reduced to the problem of quadratic programming with a positive semidefinite matrix. Using the results of quadratic programming, we obtain the modified simplex method for the solution of this problem by adding—-removing interpolating knots of a spline.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
