{"title":"信赖域高斯-牛顿方法的非标准标度矩阵","authors":"H. Schwetlick, V. Tiller","doi":"10.1137/0910040","DOIUrl":null,"url":null,"abstract":"For solving large nonlinear least-squares problems via trust region Gauss–Newton methods, nonstandard scaling matrices are proposed for scaling the norm of the step. The scaling matrices are rectangular, of full rank, and contain a block of the Jacobian matrix of the residual function.Three types of such matrices are investigated. The corresponding trust region methods are shown to have qualitatively the same convergence properties as the standard method. Nonstandard scaling matrices are especially intended for solving large and structured problems such as orthogonal distance regression or surface fitting. Initial computational experience suggests that for such problems the proposed scaling implies sometimes a modest increase in the number of iterations but reduces the overall computational costs.","PeriodicalId":200176,"journal":{"name":"Siam Journal on Scientific and Statistical Computing","volume":"88 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Nonstandard scaling matrices for trust region Gauss-Newton methods\",\"authors\":\"H. Schwetlick, V. Tiller\",\"doi\":\"10.1137/0910040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For solving large nonlinear least-squares problems via trust region Gauss–Newton methods, nonstandard scaling matrices are proposed for scaling the norm of the step. The scaling matrices are rectangular, of full rank, and contain a block of the Jacobian matrix of the residual function.Three types of such matrices are investigated. The corresponding trust region methods are shown to have qualitatively the same convergence properties as the standard method. Nonstandard scaling matrices are especially intended for solving large and structured problems such as orthogonal distance regression or surface fitting. Initial computational experience suggests that for such problems the proposed scaling implies sometimes a modest increase in the number of iterations but reduces the overall computational costs.\",\"PeriodicalId\":200176,\"journal\":{\"name\":\"Siam Journal on Scientific and Statistical Computing\",\"volume\":\"88 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Siam Journal on Scientific and Statistical Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/0910040\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Siam Journal on Scientific and Statistical Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/0910040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Nonstandard scaling matrices for trust region Gauss-Newton methods
For solving large nonlinear least-squares problems via trust region Gauss–Newton methods, nonstandard scaling matrices are proposed for scaling the norm of the step. The scaling matrices are rectangular, of full rank, and contain a block of the Jacobian matrix of the residual function.Three types of such matrices are investigated. The corresponding trust region methods are shown to have qualitatively the same convergence properties as the standard method. Nonstandard scaling matrices are especially intended for solving large and structured problems such as orthogonal distance regression or surface fitting. Initial computational experience suggests that for such problems the proposed scaling implies sometimes a modest increase in the number of iterations but reduces the overall computational costs.