In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
In this paper, we prove that the surface of any circular cone can be triangulated into 8 non-obtuse and 20 acute triangles. Furthermore, we also show that the bounds are both the best possible.
基于FDK(Feldkamp,Davis and Kress)重建算法的圆轨道锥束扫描方式,因为算法的简洁性和工程实现的可行性,成为目前主要的三维工业计算机X射线断层摄影术(3D-ICT)成像技术。但受探测器长度的限制,该种技术的扫描视场小,可检构件尺寸受到...基于FDK(Feldkamp,Davis and Kress)重建算法的圆轨道锥束扫描方式,因为算法的简洁性和工程实现的可行性,成为目前主要的三维工业计算机X射线断层摄影术(3D-ICT)成像技术。但受探测器长度的限制,该种技术的扫描视场小,可检构件尺寸受到限制。为解决较大尺寸构件3D-ICT检测问题,讨论了一种扫描锥束偏转的准三代3D-ICT成像方法,推导了它基于FDK原理的滤波反投影(FBP)重建算法。计算机仿真验证了该方法的正确性。分析表明,在扫描锥束偏转两次情况下,其有效扫描视野比圆轨道扫描方式提高1.4倍以上。展开更多
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
文摘In this paper, we prove that the surface of any circular cone can be triangulated into 8 non-obtuse and 20 acute triangles. Furthermore, we also show that the bounds are both the best possible.
文摘基于FDK(Feldkamp,Davis and Kress)重建算法的圆轨道锥束扫描方式,因为算法的简洁性和工程实现的可行性,成为目前主要的三维工业计算机X射线断层摄影术(3D-ICT)成像技术。但受探测器长度的限制,该种技术的扫描视场小,可检构件尺寸受到限制。为解决较大尺寸构件3D-ICT检测问题,讨论了一种扫描锥束偏转的准三代3D-ICT成像方法,推导了它基于FDK原理的滤波反投影(FBP)重建算法。计算机仿真验证了该方法的正确性。分析表明,在扫描锥束偏转两次情况下,其有效扫描视野比圆轨道扫描方式提高1.4倍以上。
