Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problem...Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.展开更多
摄像机绝对位姿估计问题,即透视n点问题(Perspective-n-point Problem,Pn P)在计算机视觉、摄影测量、机器人技术与增强现实等领域具有重要应用。解决该问题的经典算法直接线性转换(Direct Linear Transform,DLT)算法与其他高精度算法...摄像机绝对位姿估计问题,即透视n点问题(Perspective-n-point Problem,Pn P)在计算机视觉、摄影测量、机器人技术与增强现实等领域具有重要应用。解决该问题的经典算法直接线性转换(Direct Linear Transform,DLT)算法与其他高精度算法相比计算速度快但估计结果误差较大。文中提出通过充分利用旋转矩阵的约束改进DLT算法,仿真实验测试表明:新算法显著地降低了DLT算法的位姿估计误差,且与高精度算法相当,同时保留了计算效率高的特性。展开更多
The Krasnoselskii-Mann iteration plays an important role in the approximation of fixed points of nonexpansive mappings,and it is well known that the clas-sic Krasnoselskii-Mann iteration is weakly convergent in Hilber...The Krasnoselskii-Mann iteration plays an important role in the approximation of fixed points of nonexpansive mappings,and it is well known that the clas-sic Krasnoselskii-Mann iteration is weakly convergent in Hilbert spaces.The weak convergence is also known even in Banach spaces.Recently,Kanzow and Shehu pro-posed a generalized Krasnoselskii-Mann-type iteration for nonexpansive mappings and established its convergence in Hilbert spaces.In this paper,we show that the generalized Krasnoselskii-Mann-type iteration proposed by Kanzow and Shehu also converges in Banach spaces.As applications,we proved the weak convergence of generalized proximal point algorithm in the uniformly convex Banach spaces.展开更多
基金The project supported by the National Natural Science foundation of china(10225212,50178016.10302007)the National Kev Basic Research Special Foundation and the Ministry of Education of China
文摘Three dimensional frictional contact problems are formulated as linear complementarity problems based on the parametric variational principle. Two aggregate-functionbased algorithms for solving complementarity problems are proposed. One is called the self-adjusting interior point algorithm, the other is called the aggregate function smoothing algorithm. Numerical experiment shows the efficiency of the proposed two algorithms.
文摘摄像机绝对位姿估计问题,即透视n点问题(Perspective-n-point Problem,Pn P)在计算机视觉、摄影测量、机器人技术与增强现实等领域具有重要应用。解决该问题的经典算法直接线性转换(Direct Linear Transform,DLT)算法与其他高精度算法相比计算速度快但估计结果误差较大。文中提出通过充分利用旋转矩阵的约束改进DLT算法,仿真实验测试表明:新算法显著地降低了DLT算法的位姿估计误差,且与高精度算法相当,同时保留了计算效率高的特性。
基金supported by the Students Innovation and Entrepreneurship Training Program Foundation of China West Normal University(No.201810638047)supported by the National Natural Science Foundation of China(Nos.11571178 and 11801455)Fundamental Research Funds of China West Normal University(Nos.17E084 and 18B031).
文摘The Krasnoselskii-Mann iteration plays an important role in the approximation of fixed points of nonexpansive mappings,and it is well known that the clas-sic Krasnoselskii-Mann iteration is weakly convergent in Hilbert spaces.The weak convergence is also known even in Banach spaces.Recently,Kanzow and Shehu pro-posed a generalized Krasnoselskii-Mann-type iteration for nonexpansive mappings and established its convergence in Hilbert spaces.In this paper,we show that the generalized Krasnoselskii-Mann-type iteration proposed by Kanzow and Shehu also converges in Banach spaces.As applications,we proved the weak convergence of generalized proximal point algorithm in the uniformly convex Banach spaces.
