An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in th...An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.展开更多
In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure betwe...In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.展开更多
In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barr...In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.展开更多
A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Un...A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.展开更多
A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a...A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a background mesh. It is shown that, in a point collocation approach, the remesh problem because of the mesh distortion in FEM （finite element method） and the low efficiency in Galerkin-based meshfree method are avoided. The corrected kernel functions are introduced to the stabilization of free-surface boundary conditions. The solution of symmetric ring compression problem is compared with a conventional finite element solution, and reasonable results have been obtained.展开更多
In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps....In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.展开更多
This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the fea...This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.展开更多
对于背景呈非线性变化的复杂图像,用背景预测的方法对红外点目标进行检测时,传统的线性最小二乘法(Least Squares,LS)的效果比较差。文章使用核方法(Kernel Methods,KMs)推导了最小二乘法的非线性版本:核最小二乘算法(Kernel Least Squa...对于背景呈非线性变化的复杂图像,用背景预测的方法对红外点目标进行检测时,传统的线性最小二乘法(Least Squares,LS)的效果比较差。文章使用核方法(Kernel Methods,KMs)推导了最小二乘法的非线性版本:核最小二乘算法(Kernel Least Squares,KLS);进一步推导出了更适合动态系统时序预测的指数加权形式的核最小二乘算法(Kernel Exponential Weighted Least Squares,KEWLS)。提出了一种基于核方法的红外点目标检测算法,先用KEWLS非线性回归算法预测红外图像背景,再通过自适应门限检测残差图像中的目标。非线性函数回归和红外序列图像检测实验表明核方法较大地改进了算法的非线性函数估计与红外背景预测能力。展开更多
基金supported by the National Natural Science Foundation of China(Grant No.11171208)the Natural Science Foundation of Shanxi Province,China(Grant No.2013011022-6)
文摘An interpolating reproducing kernel particle method for two-dimensional （2D） scatter points is introduced. It elim- inates the dependency of gridding in numerical calculations. The interpolating shape function in the interpolating repro- ducing kernel particle method satisfies the property of the Kronecker delta function. This method offers a mathematics basis for recognition technology and simulation analysis, which can be expressed as simultaneous differential equations in science or project problems. Mathematical examples are given to show the validity of the interpolating reproducing kernel particle method.
基金Supported by the Natural Science Foundation of Hubei Province(2008CDZD47)
文摘In this paper, we present a large-update primal-dual interior-point method for symmetric cone optimization（SCO） based on a new kernel function, which determines both search directions and the proximity measure between the iterate and the center path. The kernel function is neither a self-regular function nor the usual logarithmic kernel function. Besides, by using Euclidean Jordan algebraic techniques, we achieve the favorable iteration complexity O（ √r（1/2）（log r）^2 log（r/ ε））, which is as good as the convex quadratic semi-definite optimization analogue.
基金Supported by the Natural Science Foundation of Hubei Province (2008CDZD47)
文摘In this paper, we design a primal-dual interior-point algorithm for linear optimization. Search directions and proximity function are proposed based on a new kernel function which includes neither growth term nor barrier term. Iteration bounds both for large-and small-update methods are derived, namely, O（nlog（n/c）） and O（√nlog（n/ε））. This new kernel function has simple algebraic expression and the proximity function has not been used before. Analogous to the classical logarithmic kernel function, our complexity analysis is easier than the other pri- mal-dual interior-point methods based on logarithmic barrier functions and recent kernel functions.
基金supported by the National Natural Science Foundation of China (Grant No.10771133)the Shanghai Pujiang Program (Grant No.06PJ14039)
文摘A polynomial interior-point algorithm is presented for monotone linear complementarity problem （MLCP） based on a class of kernel functions with the general barrier term, which are called general kernel functions. Under the mild conditions for the barrier term, the complexity bound of algorithm in terms of such kernel function and its derivatives is obtained. The approach is actually an extension of the existing work which only used the specific kernel functions for the MLCP.
基金the National Natural Science Foundation of China （No. 50275059）.
文摘A meshfree method based on reproducing kernel approximation and point collocation is presented for analysis of metal ring compression. The point collocation method is a true meshfree method without the employment of a background mesh. It is shown that, in a point collocation approach, the remesh problem because of the mesh distortion in FEM （finite element method） and the low efficiency in Galerkin-based meshfree method are avoided. The corrected kernel functions are introduced to the stabilization of free-surface boundary conditions. The solution of symmetric ring compression problem is compared with a conventional finite element solution, and reasonable results have been obtained.
文摘In this paper, we propose a new infeasible interior-point algorithm with full NesterovTodd (NT) steps for semidefinite programming (SDP). The main iteration consists of a feasibility step and several centrality steps. We used a specific kernel function to induce the feasibility step. The analysis is more simplified. The iteration bound coincides with the currently best known bound for infeasible interior-point methods.
基金Sponsored by the National Natural Science Foundation of China(Grant No.11461021)the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2017JM1014)Scientific Research Project of Hezhou University(Grant Nos.2014YBZK06 and 2016HZXYSX03)
文摘This paper proposes a new full Nesterov-Todd(NT) step infeasible interior-point algorithm for semidefinite programming. Our algorithm uses a specific kernel function, which is adopted by Liu and Sun, to deduce the feasibility step. By using the step, it is remarkable that in each iteration of the algorithm it needs only one full-NT step, and can obtain an iterate approximate to the central path. Moreover, it is proved that the iterative bound corresponds with the known optimal one for semidefinite optimization problems.
文摘对于背景呈非线性变化的复杂图像,用背景预测的方法对红外点目标进行检测时,传统的线性最小二乘法(Least Squares,LS)的效果比较差。文章使用核方法(Kernel Methods,KMs)推导了最小二乘法的非线性版本:核最小二乘算法(Kernel Least Squares,KLS);进一步推导出了更适合动态系统时序预测的指数加权形式的核最小二乘算法(Kernel Exponential Weighted Least Squares,KEWLS)。提出了一种基于核方法的红外点目标检测算法,先用KEWLS非线性回归算法预测红外图像背景,再通过自适应门限检测残差图像中的目标。非线性函数回归和红外序列图像检测实验表明核方法较大地改进了算法的非线性函数估计与红外背景预测能力。
