High-speed vehicle dynamic envelope curve is defined as the maximum limit outline affected by a variety of adverse factors while the train is running. Considering the difficulties in the current measurement system suc...High-speed vehicle dynamic envelope curve is defined as the maximum limit outline affected by a variety of adverse factors while the train is running. Considering the difficulties in the current measurement system such as complicated calibration process,cumbersome aided-instruments,strict limitation of working distance, this paper carries out an optical method in which two high-speed cameras with variable-zoom lenses are adopted as binocular stereo sensors of measurement system and a high-ac-curacy 3D target with fast reconstruction is designed. The intrinsic parameters of the sensors and the relative positions between coordinate systems are solved by the method of colinearity constrained optimization algorithm. The calibration process is easy to operate and the device is also of portability. Most importantly, the severe working distance limitation between sensors and measured body is solved, enhancing the adaptability of measurement system to environment. Experimental results show that when the sensors are in the range of 8 -16 m away from the measured body, system accuracy can reach up to ±0. 5 mm, which meets the requirements to measure the dynamic envelope curve of high-speed vehicle.展开更多
Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS met...Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.展开更多
This paper puts forward a two-parameter family of nonlinear conjugate gradient(CG)method without line search for solving unconstrained optimization problem.The main feature of this method is that it does not rely on a...This paper puts forward a two-parameter family of nonlinear conjugate gradient(CG)method without line search for solving unconstrained optimization problem.The main feature of this method is that it does not rely on any line search and only requires a simple step size formula to always generate a sufficient descent direction.Under certain assumptions,the proposed method is proved to possess global convergence.Finally,our method is compared with other potential methods.A large number of numerical experiments show that our method is more competitive and effective.展开更多
This paper considers geometric error control in the parabola-blending linear interpolation method(Zhang,et al.,2011).Classical model of chord error by approximation with contact circle on the parabolas leads to incorr...This paper considers geometric error control in the parabola-blending linear interpolation method(Zhang,et al.,2011).Classical model of chord error by approximation with contact circle on the parabolas leads to incorrect result.By computing the geometric error directly without accumulating the approximation error and chord error,the authors realize correct geometric error control by establishing inequality constraints on the accelerations of the motion.展开更多
基金National Science and Technology Major Project(No.2016ZX04003001)
文摘High-speed vehicle dynamic envelope curve is defined as the maximum limit outline affected by a variety of adverse factors while the train is running. Considering the difficulties in the current measurement system such as complicated calibration process,cumbersome aided-instruments,strict limitation of working distance, this paper carries out an optical method in which two high-speed cameras with variable-zoom lenses are adopted as binocular stereo sensors of measurement system and a high-ac-curacy 3D target with fast reconstruction is designed. The intrinsic parameters of the sensors and the relative positions between coordinate systems are solved by the method of colinearity constrained optimization algorithm. The calibration process is easy to operate and the device is also of portability. Most importantly, the severe working distance limitation between sensors and measured body is solved, enhancing the adaptability of measurement system to environment. Experimental results show that when the sensors are in the range of 8 -16 m away from the measured body, system accuracy can reach up to ±0. 5 mm, which meets the requirements to measure the dynamic envelope curve of high-speed vehicle.
文摘Conjugate gradient optimization algorithms depend on the search directions with different choices for the parameters in the search directions. In this note, by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methods is presented. Global convergences of the new method with two kinds of common line searches, are proved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function, the new method for solving unconstrained optimization can work for a continously dif ferentiable function with Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique, some general convergence properties of the new method with other kind of step size rule are established. Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.
基金Supported by 2023 Inner Mongolia University of Finance and Economics,General Scientific Research for Universities directly under Inner Mon‐golia,China (NCYWT23026)2024 High-quality Research Achievements Cultivation Fund Project of Inner Mongolia University of Finance and Economics,China (GZCG2479)。
文摘This paper puts forward a two-parameter family of nonlinear conjugate gradient(CG)method without line search for solving unconstrained optimization problem.The main feature of this method is that it does not rely on any line search and only requires a simple step size formula to always generate a sufficient descent direction.Under certain assumptions,the proposed method is proved to possess global convergence.Finally,our method is compared with other potential methods.A large number of numerical experiments show that our method is more competitive and effective.
基金supported partially by the National Natural Science Foundation of China under Grant Nos.10871195 and 60821002/F02National Center for Mathematics and Interdisciplinary Sciences of Chinese Academy of Sciences
文摘This paper considers geometric error control in the parabola-blending linear interpolation method(Zhang,et al.,2011).Classical model of chord error by approximation with contact circle on the parabolas leads to incorrect result.By computing the geometric error directly without accumulating the approximation error and chord error,the authors realize correct geometric error control by establishing inequality constraints on the accelerations of the motion.
