Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some condition...In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm.展开更多
In this paper, we proposed an iterative reweighted l1?penalty regression approach to solve the line spectral estimation problem. In each iteration process, we first use the ideal of Bayesian lasso to update the sparse...In this paper, we proposed an iterative reweighted l1?penalty regression approach to solve the line spectral estimation problem. In each iteration process, we first use the ideal of Bayesian lasso to update the sparse vectors;the derivative of the penalty function forms the regularization parameter. We choose the anti-trigonometric function as a penalty function to approximate the?l0? norm. Then we use the gradient descent method to update the dictionary parameters. The theoretical analysis and simulation results demonstrate the effectiveness of the method and show that the proposed algorithm outperforms other state-of-the-art methods for many practical cases.展开更多
The Galerkin and least-squares methods are two classes of the most popular Krylov subspace methOds for solving large linear systems of equations. Unfortunately, both the methods may suffer from serious breakdowns of t...The Galerkin and least-squares methods are two classes of the most popular Krylov subspace methOds for solving large linear systems of equations. Unfortunately, both the methods may suffer from serious breakdowns of the same type: In a breakdown situation the Galerkin method is unable to calculate an approximate solution, while the least-squares method, although does not really break down, is unsucessful in reducing the norm of its residual. In this paper we first establish a unified theorem which gives a relationship between breakdowns in the two methods. We further illustrate theoretically and experimentally that if the coefficient matrix of a lienar system is of high defectiveness with the associated eigenvalues less than 1, then the restarted Galerkin and least-squares methods will be in great risks of complete breakdowns. It appears that our findings may help to understand phenomena observed practically and to derive treatments for breakdowns of this type.展开更多
In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative meth...In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.展开更多
目前商用桥梁动态称重系统(weigh-in-motion systems,BWIM)大多基于Moses算法,虽然能高效快速地识别行驶于桥梁的车辆轴重,但轴重识别精度偏低。为解决这一问题,提出基于迭代加权最小二乘的桥梁动态称重(iteratively reweighted least s...目前商用桥梁动态称重系统(weigh-in-motion systems,BWIM)大多基于Moses算法,虽然能高效快速地识别行驶于桥梁的车辆轴重,但轴重识别精度偏低。为解决这一问题,提出基于迭代加权最小二乘的桥梁动态称重(iteratively reweighted least squares,IRLS)算法。与Moses算法不同,IRLS算法考虑了荷载响应中存在的多种不确定性因素,为每个荷载响应值提供一个合适的权重系数,区分不同荷载响应对轴重识别的贡献度。首先,将迭代加权最小二乘引入桥梁动态称重,推导出相应的轴重识别计算公式;然后,通过车桥数值仿真模型,分别用IRLS算法和Moses算法识别轴重,对比分析两种算法的精度及影响因素;最后,基于怀化舞水五桥引桥的车桥动力试验,进一步验证IRLS算法用于桥梁动态称重的有效性和准确性。结果表明,IRLS算法能较合理地分配不同荷载响应对轴重识别的贡献度,在一定程度上提高车辆轴重识别的精度。展开更多
针对零件缺陷、反光或是环境光照不足不均,提出了一种通过卷积神经网络(CNN)一次定位,再二次运用改进迭代重加权最小二乘法(Iterative Reweighted Least Squares,以下简称IRLS)进行筛选和拟合进而进行二次定位的方法。在一次定位时,训...针对零件缺陷、反光或是环境光照不足不均,提出了一种通过卷积神经网络(CNN)一次定位,再二次运用改进迭代重加权最小二乘法(Iterative Reweighted Least Squares,以下简称IRLS)进行筛选和拟合进而进行二次定位的方法。在一次定位时,训练模型的准确率和召回率分别达到98.2%和97.4%,结合二次定位识别率为99.1%,相较于常规形态学筛选和模板匹配在复杂光照下的识别率分别提高了31.9%和15.5%。二次定位时,圆孔的最大定位误差为0.65mm,平均误差0.31mm。对比Hough法和CNN直接定位,最大误差分别减少了33.0%和53.9%,平均误差分别减少了36.7%和50.8%。展开更多
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
文摘In this paper, we present continuous iteratively reweighted least squares algorithm (CIRLS) for solving the linear models problem by convex relaxation, and prove the convergence of this algorithm. Under some conditions, we give an error bound for the algorithm. In addition, the numerical result shows the efficiency of the algorithm.
文摘In this paper, we proposed an iterative reweighted l1?penalty regression approach to solve the line spectral estimation problem. In each iteration process, we first use the ideal of Bayesian lasso to update the sparse vectors;the derivative of the penalty function forms the regularization parameter. We choose the anti-trigonometric function as a penalty function to approximate the?l0? norm. Then we use the gradient descent method to update the dictionary parameters. The theoretical analysis and simulation results demonstrate the effectiveness of the method and show that the proposed algorithm outperforms other state-of-the-art methods for many practical cases.
文摘The Galerkin and least-squares methods are two classes of the most popular Krylov subspace methOds for solving large linear systems of equations. Unfortunately, both the methods may suffer from serious breakdowns of the same type: In a breakdown situation the Galerkin method is unable to calculate an approximate solution, while the least-squares method, although does not really break down, is unsucessful in reducing the norm of its residual. In this paper we first establish a unified theorem which gives a relationship between breakdowns in the two methods. We further illustrate theoretically and experimentally that if the coefficient matrix of a lienar system is of high defectiveness with the associated eigenvalues less than 1, then the restarted Galerkin and least-squares methods will be in great risks of complete breakdowns. It appears that our findings may help to understand phenomena observed practically and to derive treatments for breakdowns of this type.
文摘In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.
文摘目前商用桥梁动态称重系统(weigh-in-motion systems,BWIM)大多基于Moses算法,虽然能高效快速地识别行驶于桥梁的车辆轴重,但轴重识别精度偏低。为解决这一问题,提出基于迭代加权最小二乘的桥梁动态称重(iteratively reweighted least squares,IRLS)算法。与Moses算法不同,IRLS算法考虑了荷载响应中存在的多种不确定性因素,为每个荷载响应值提供一个合适的权重系数,区分不同荷载响应对轴重识别的贡献度。首先,将迭代加权最小二乘引入桥梁动态称重,推导出相应的轴重识别计算公式;然后,通过车桥数值仿真模型,分别用IRLS算法和Moses算法识别轴重,对比分析两种算法的精度及影响因素;最后,基于怀化舞水五桥引桥的车桥动力试验,进一步验证IRLS算法用于桥梁动态称重的有效性和准确性。结果表明,IRLS算法能较合理地分配不同荷载响应对轴重识别的贡献度,在一定程度上提高车辆轴重识别的精度。
文摘针对零件缺陷、反光或是环境光照不足不均,提出了一种通过卷积神经网络(CNN)一次定位,再二次运用改进迭代重加权最小二乘法(Iterative Reweighted Least Squares,以下简称IRLS)进行筛选和拟合进而进行二次定位的方法。在一次定位时,训练模型的准确率和召回率分别达到98.2%和97.4%,结合二次定位识别率为99.1%,相较于常规形态学筛选和模板匹配在复杂光照下的识别率分别提高了31.9%和15.5%。二次定位时,圆孔的最大定位误差为0.65mm,平均误差0.31mm。对比Hough法和CNN直接定位,最大误差分别减少了33.0%和53.9%,平均误差分别减少了36.7%和50.8%。
