TP242.6//TP391.4 2002053621基于残差平方和的光流场正规化方法=Regularizationfor optical flow fields with residual sum of squares[刊,中]/范勇,游志胜,张建州(四川大学图形图像研究所.四川,成都(610064)),郑文琛(四川大学材料科...TP242.6//TP391.4 2002053621基于残差平方和的光流场正规化方法=Regularizationfor optical flow fields with residual sum of squares[刊,中]/范勇,游志胜,张建州(四川大学图形图像研究所.四川,成都(610064)),郑文琛(四川大学材料科学系.四川,成都(610064))//光电工程.—2001,28(6).展开更多
Recently,inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications.After the discretization,many of inverse problems are reduced...Recently,inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications.After the discretization,many of inverse problems are reduced to linear systems.Due to the typical ill-posedness of inverse problems,the reduced linear systems are often illposed,especially when their scales are large.This brings great computational difficulty.Particularly,a small perturbation in the right side of an ill-posed linear system may cause a dramatical change in the solution.Therefore,regularization methods should be adopted for stable solutions.In this paper,a new class of accelerated iterative regularization methods is applied to solve this kind of large-scale ill-posed linear systems.An iterative scheme becomes a regularization method only when the iteration is early terminated.And a Morozov’s discrepancy principle is applied for the stop criterion.Compared with the conventional Landweber iteration,the new methods have acceleration effect,and can be compared to the well-known acceleratedν-method and Nesterov method.From the numerical results,it is observed that using appropriate discretization schemes,the proposed methods even have better behavior when comparing withν-method and Nesterov method.展开更多
this paper,we propose a class of smoothing-regularization methods for solving the mathematical programming with vanishing constraints.These methods include the smoothing-regularization method proposed by Kanzow et al....this paper,we propose a class of smoothing-regularization methods for solving the mathematical programming with vanishing constraints.These methods include the smoothing-regularization method proposed by Kanzow et al.in[Comput.Optim.Appl.,2013,55(3):733-767]as a special case.Under the weaker conditions than the ones that have been used by Kanzow et al.in 2013,we prove that the Mangasarian-Fromovitz constraint qualification holds at the feasible points of smoothing-regularization problem.We also analyze that the convergence behavior of the proposed smoothing-regularization method under mild conditions,i.e.,any accumulation point of the stationary point sequence for the smoothing-regularization problem is a strong stationary point.Finally,numerical experiments are given to show the efficiency of the proposed methods.展开更多
文摘TP242.6//TP391.4 2002053621基于残差平方和的光流场正规化方法=Regularizationfor optical flow fields with residual sum of squares[刊,中]/范勇,游志胜,张建州(四川大学图形图像研究所.四川,成都(610064)),郑文琛(四川大学材料科学系.四川,成都(610064))//光电工程.—2001,28(6).
基金supported by the Natural Science Foundation of China (Nos. 11971230, 12071215)the Fundamental Research Funds for the Central Universities(No. NS2018047)the 2019 Graduate Innovation Base(Laboratory)Open Fund of Jiangsu Province(No. Kfjj20190804)
文摘Recently,inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications.After the discretization,many of inverse problems are reduced to linear systems.Due to the typical ill-posedness of inverse problems,the reduced linear systems are often illposed,especially when their scales are large.This brings great computational difficulty.Particularly,a small perturbation in the right side of an ill-posed linear system may cause a dramatical change in the solution.Therefore,regularization methods should be adopted for stable solutions.In this paper,a new class of accelerated iterative regularization methods is applied to solve this kind of large-scale ill-posed linear systems.An iterative scheme becomes a regularization method only when the iteration is early terminated.And a Morozov’s discrepancy principle is applied for the stop criterion.Compared with the conventional Landweber iteration,the new methods have acceleration effect,and can be compared to the well-known acceleratedν-method and Nesterov method.From the numerical results,it is observed that using appropriate discretization schemes,the proposed methods even have better behavior when comparing withν-method and Nesterov method.
基金Supported in part by NSFC(No.11961011)Guangxi Science and Technology Base and Talents Special Project(No.2021AC06001).
文摘this paper,we propose a class of smoothing-regularization methods for solving the mathematical programming with vanishing constraints.These methods include the smoothing-regularization method proposed by Kanzow et al.in[Comput.Optim.Appl.,2013,55(3):733-767]as a special case.Under the weaker conditions than the ones that have been used by Kanzow et al.in 2013,we prove that the Mangasarian-Fromovitz constraint qualification holds at the feasible points of smoothing-regularization problem.We also analyze that the convergence behavior of the proposed smoothing-regularization method under mild conditions,i.e.,any accumulation point of the stationary point sequence for the smoothing-regularization problem is a strong stationary point.Finally,numerical experiments are given to show the efficiency of the proposed methods.
