澳门新葡8455最新网站,www.8455.com,新葡京最新官网

当前位置: 澳门新葡8455最新网站 > 学术活动 > 正文
Modulus Methods for Box Constrained Least Squares Problems
澳门新葡8455最新网站:2016年11月30日 13:49 点击数:

报告人:Ken Hayami

报告地点:澳门新葡8455最新网站二楼会议室

报告澳门新葡8455最新网站:2016年12月08日星期四13:30-14:20

邀请人:

报告摘要:

For the solution of large sparse box constrained least squares problems (BLS), a new class of iterative methods is proposed by utilizing the modulus transformation, which converts the solution of the BLS into a sequence of unconstrained least squares problems. Efficient Krylov subspace methods with suitable preconditioners are applied to solve the inner unconstrained least squares problems at each outer iteration. In addition, the method can be further enhanced by incorporating the active set strategy, which contains two stages where the first stage solves the reduced unconstrained least squares problems only on the inactive variables, and projects the solution into the feasible region. We also analyze the convergence of the method including the choice of the parameter. Numerical experiments show the efficiency of the proposed methods in comparison to the gradient projection methods, the Newton like methods and the interior point methods.

This is joint work with Dr. Ning Zheng and Prof. Jun-Feng Yin

 

主讲人概况:

Ken Hayami obtained PhD from the Wessex Institute of Technology (1991) and the University of Tokyo (1993), respectively. Currently, he is a professor in the Principles of Informatics Research Division of NII and the Department of Informatics at SOKENDAI (The Graduate University of Advanced Studies) .

Copyright ©版权所有:澳门新葡8455最新网站

地址:吉林省长春市人民大街5268号|邮编:130024|电话:0431-85099589|传真:0431-85098237


XML 地图 | Sitemap 地图