Research Article  Open Access
Nengjian Wang, Qinhui Liu, Chunping Ren, Chunsheng Liu, "A Novel Method of Dynamic Force Identification and Its Application", Mathematical Problems in Engineering, vol. 2019, Article ID 1534560, 10 pages, 2019. https://doi.org/10.1155/2019/1534560
A Novel Method of Dynamic Force Identification and Its Application
Abstract
In this paper, an efficient mixed spectral conjugate gradient (EMSCG, for short) method is presented for solving unconstrained optimization problems. In this work, we construct a novel formula performed by using a conjugate gradient parameter which takes into account the advantages of Fletcher–Reeves (FR), Polak–Ribiere–Polyak (PRP), and a variant PolakRibierePolyak (VPRP), prove its stability and convergence, and apply it to the dynamic force identification of practical engineering structure. The analysis results show that the present method has higher efficiency, stronger robust convergence quality, and fewer iterations. In addition, the proposed method can provide more efficient and numerically stable approximation of the actual force, compared with the FR method, PRP method, and VPRP method. Therefore, we can make a clear conclusion that the proposed method in this paper can provide an effective optimization solution. Meanwhile, there is reason to believe that the proposed method can offer a reference for future research.
1. Introduction
It is of great significance to solve the engineering problem about the identification of the dynamic loads acting on the practical engineering structure with the improvement of engineering requirements and the progress of engineering technology [1–3]. Load identification is a kind of inverse problem, which is ill posed. At the same time, in many practical engineering problems, it is not easy to promptly obtain the dynamic loads in virtue of technical limitations [4, 5]. In general, we will tend to use indirect methods to restore the expected load on actual engineering structures.
As well as known, the regularization method can be used to solve the illposed problem procedure which can be translated into a kind of unconstrained optimization problems [6–10]; then, some optimization algorithms are used to solve it, such as conjugate gradient (CG) method, memory gradient (MG) method, and supermemory gradient (SMG) method [11–13]. It is generally known that the CG method does not achieve global convergence for common functions under inexact line searches [14], whereas the MG method needs to deal with the trust region subproblem [15]. Although the SMG method is superior to CG and MG methods, in some cases, it is also not globally convergent [16]. However, the spectral conjugate gradient (SCG) method does a lot of important works among various methods for solving unconstrained optimization problems [17]. The SCG method combines the spectral gradient and the conjugate gradient. The choice of spectral parameters is crucially important for the SCG method [18]. In this paper, we propose an efficient mixed spectral conjugate gradient (EMSCG) method, a novel formula performed by using a conjugate gradient parameter which takes into account the advantages of Fletcher–Reeves (FR) method [19], Polak–Ribiere–Polyak (PRP) method [20], and variant Polak–Ribiere–Polyak (VPRP) method [21] is constructed. The purpose of this paper is to find an effective method to deal with unconstrained optimization problems. In this way, an unconstrained optimization problem can be represented as [22]where the nonlinear function is a continuously differentiable function whose gradient is denoted by .
Furthermore, a sequence can be obtained in an algorithm for solving (1) and has the following forms [23–25]:where is a search direction and is the step size which is achieved by the onedimensional search method. Usually, the exact line search is described as follows [26]:
It is well known that there are different ways to determine . In the conjugate gradient (CG) method, can be expressed by [27]where denotes a scalar parameter characterizing the conjugate gradient method. The bestknown expressions of are Hestenes–Stiefel (HS) [28], Fletcher–Reeves (FR) [19], Polak–Ribiere–Polyak (PRP) [20], and Dai–Yuan (DY) [29] formulas, which are defined byrespectively, where denotes the Euclidean norm and . At the same time, (5) corresponds to four different conjugate gradient methods, and different methods have a lot of deformations. For example, in [20], a variant of PRP is given; is expressed as
The VPRP method inherits some excellent properties of the PRP method, such as good numerical performance. Liu and Li [30] proved that the VPRP method has global convergence and descending property under strong Wolfe line search.
In recent years, some scholars developed a new method, spectral conjugate gradient (SCG) method, for solving (1). In [31], the spectral gradient method for largescale unconstrained optimization was introduced, which combined a nonmonotone line search strategy that guarantees global convergence with the Barzilai and Borwein method. Utilizing spectral gradient and conjugate gradient ideas, Chen and Jiang [32] proposed a spectral conjugate gradient method. In these algorithms, the search direction has the following form:
However, the search direction of the spectral conjugate gradient method proposed by Birgin and Martinez does not satisfy the descent property, and of course, it does not have global convergence. In order to obtain global convergence, Wang et al. [19, 33] constructed the FRtype spectral conjugate gradient method; spectral parameters and are expressed as
An important feature of this method is to satisfy the sufficient descent condition:where is a constant.
The CDtype spectral conjugate gradient method is proposed in [34]. Reference [35] provided a HStype spectral conjugate gradient method. A spectral conjugate gradient method for the PRP type is introduced in [36]. All the above methods meet the sufficient conditions of decline (3).
Based on the above literature, an efficient mixed spectral conjugate gradient method with sufficient descent is proposed, which was abbreviated as the EMSCG method, and parameters and are expressed aswhere is a parameter and .
As we can see from the algorithm framework above, the EMSCG method is similar to other spectral conjugate gradient algorithms. However, we choose two different spectral parameters and which is the main difference between the EMSCG method and the others.
The present paper is organized as follows. In Section 2, the properties of an efficient mixed spectral conjugate gradient method are introduced. The global convergence is proved in Section 3, while the analysis results compared with the FR method, PRP method, and VPRP method, which are given in Section 4. In the last section, we draw some conclusions about an efficient mixed spectral conjugate gradient method.
2. Properties of an Efficient Mixed Spectral Conjugate (EMSCG) Gradient Method
The following is a detailed description of an efficient mixed spectral conjugate gradient (EMSCG) method.
First of all, let us state a question, the constructed is a search direction. The following theorems and proofs are obtained.
Theorem 1. Suppose that and are generated by using Algorithm 1, and the sufficient descent condition holds. Then,for all .
Proof. By Algorithm 1, we haveHence, (11) is proved.
Theorem 2. Parameter satisfiesfor all .
Proof. We know that this is the mixture of the three methods according to formula (10), and now it is explained in three cases.(i)When , we have(ii)When and , we have(iii)When and , we haveThe proof is effectively completed. In addition, from the selection of spectral coefficient of Algorithm 1, we can select the different parameters to optimize the numerical effect of Algorithm 1.
3. Convergent Analysis of the Proposed Method
In order to study the convergence of the algorithm, some basic assumptions are given as follows:
Assumption A. (P1)The objective function is bounded by the following level: (P2) The gradient is Lipschitz continuous; that is, there exists a constant such that, for any , we obtain
Lemma 1. Suppose that the function has the properties (P1) and (P2). is a descent direction and is obtained by (3); then,In [14, 37, 38], Dai and Yuan stated that (19) had been essentially proved by Zoutendijk and Wolfe.
Lemma 2. Suppose that assumption A holds, sequences are generated by Algorithm 1; then,
Proof. Suppose that (19) is not established, there is a constant ; for all , we have .
According to formula (7), we getThen,Exploiting (22), we haveThen,Combining (24) and Theorem 1, we haveDividing both sides by , we haveThen, we haveHence, we can obtainFrom the above discussion, we can see that it is in contradiction with Lemma 1. Therefore, the conclusion is established.
4. An Example of Engineering Application
In this section, the present method is applied to an engineering example of the identification problem of dynamic force generated between conical pick and coalseam structure.
4.1. Establishment of the Dynamic Force Model
An abridged general view of dynamic force between pick and coalseam structure is plotted in Figure 1. For a deterministic multidegreesoffreedom structures, we can use a unified dynamic equation to represent it, which can be expressed by the following form [39]:where , , and denote the mass matrix, damping matrix, and stiffness matrix, respectively; denotes the dynamic force column vector in different directions; , , and denote displacement response vector, velocity response vector, and acceleration response vector, respectively.
(a)
(b)
The displacement of the structure can be described aswhere denotes the matrix of mode and and denotes the displacement vector and time function in the generalized coordinates, .
Combined with equations (29) and (30), the dynamic equations represented by the physical coordinates are transformed into the modal coordinate system, and the decoupled modal equations are described aswhere denotes the order modal damping ratio and and denote the generalized mass and the generalized force, respectively, and , .
and denotes the initial velocity and initial displacement of the system, respectively. Hence, the in equation (30) is expressed as follows:
is obtained by the homogeneous equation of equation (29), which is described as follows:
Here, and are the corresponding values in modal coordinates; it is described as follows:
Here, is expressed in the following form owing to it having nothing to do with the initial conditions of the system:
The displacement of the system is expressed as follows:
Here, and .
The displacement of the system can be represented as follows:
The following expressions can be obtained by introducing equations (33) and (35) into equation (37):
Usually, can be described as
Hence, can be described by comparing equations (38) and (39):
Let and ; then, equation (39) was discretized, and it is transformed into a matrix form that can be expressed as follows:or simply noted as
Equation (42) can be expressed by the following form due to the responses containing noise:
Here, is the identified dynamic force, is the unknown noise, and . is a parameter level, is the standard deviation, and is a random number which ranges from −1 to 1.
Equation (43) is illconditioned, whose solution is usually astaticism. Then, it can be transformed into an optimization problem by using the Tikhonov regularization method [40]:
Equation (44) is considered as a kind of unconstrained optimization problem and a series of optimization algorithms, which can treat such unconstrained optimization problem. In our work, an efficient mixed spectral conjugate gradient (EMSCG) method was proposed to minimize equation (44).
4.2. Experimental Setup
In our work, a diagram of experimental setup is organized in Figure 2. The size of the coalseam structure specimen manufactured artificially was 2000 mm × 800 mm × 1750 mm; the pick is mounted on the rotary cutting arm, and it can be driven by the reducer and torque; its power driven by the motor is rated at 55 kW. The cutting bench achieves free forward and backward movement by the hydraulic pressure drive control system. System output responses can be measured by the corresponding sensors, then converted by a signal amplifier, and finally recorded by a V10Dasp data vibration signal acquisition system [41].
The cutting force generated between pick and coalseam structure is transmitted through the gear sleeve and measured by the force sensor at the back end. The measuring direction of the sensor and the cutting axis is defined as the axial load . The measuring direction of the vertical the cutting axis is defined as the radial load . The force diagram of pick is shown in Figure 3. denotes the cutting force, denotes the propulsion resistance, denotes the friction force between the supporting structure and the pick sleeve, is the tangential installation angle of the pick, is the supporting point of the gear sleeve, is the distance from the pick tip to the supporting point, and is the distance from the sensor to the supporting point. It is clearly seen from Figure 3 that the balance equation of force and the equilibrium equation of moment can be obtained, which is shown in the following equation:
By simplifying equation (45), the relationship between the cutting force and the axial load , the radial load and installation angle are obtained, as shown in the following equation:where is the friction coefficient between the gear sleeve and the supporting structure and = 0.1 and is the size coefficient of pick and sensor and = 0.739.
In this experimental, the installation angle of conical pick is 45°, the maximum cutting thickness of the pick is 20 mm, the hauling speed is 0.8 r/min, and the rotary arm speed is 41 m/min. The measured axial load and radial load of the pick are shown in Figures 4(a) and 4(b), and the cutting force is converted by equation (15) according to the load curves shown in Figures 4(a) and 4(b), which is shown in Figure 4(c).
(a)
(b)
(c)
Under the above experimental conditions, it can be seen that although the value of cutting force is different from the axial load, the change trend is similar and the radial load has little effect on the change rule; that is, the cutting force Z is proportional to the axial load . Therefore, the measured axial load can reflect the magnitude and variation of cutting force and can be approximately characterized by the measured axial load when analyzing the characteristics of cutting force.
4.3. Result Analysis
In order to study the influence of the proposed method on load identification results, and to compare with other methods, the results and methods are given. All codes were written in MATLAB 7.0 and run on a HP with 2.0 GB RAM and Windows 7 operating system. Stop the iteration if criterion is defined as is satisfied or run time is more than 500 seconds. And the step length is calculated by equation (3), the parameters are obtained as follows: and .
For performance analysis of dynamic force identification methods used, the performance measurement metrics for dynamic force are described as follows: restoration time, iterative steps, and root meansquareerror (RMSE), where RMSE is defined bywhere is the actual force and is the identified force.
In order to effectively identify dynamic force generated between conical pick and coalseam structure, first we provide the measured displacement response within 0.3 seconds which can be obtained by the finite element method, which is shown in Figure 5.
Since the measured displacement response can be given by the computed numerical solution, then we can use the present method in the paper to identify dynamic force based on the mathematical model of dynamic force identification [19, 20].
The identified results of dynamic force are achieved by using the different methods in this paper, which are shown in Figures 6(a)–6(d), respectively.
(a)
(b)
(c)
(d)
We can see from Figures 6(a)–6(d) that the different methods can identify the dynamic force generated between conical pick and coalseam structure from the measured displacement response by the finite element method. However, the performance of dynamic force identification results has a certain difference.
We can draw a conclusion from Table 1 that the present method makes it more successful to identify dynamic force generated between conical pick and coalseam structure based on the measured displacement response.

5. Conclusions
In this paper, an efficient mixed spectral conjugate gradient (EMSCG) method is proposed for the dynamic force identification. Moreover, the convergence of the proposed method based on the convergence analysis in Section 3 is strictly proved. An engineering example is investigated in Section 4, in which the performance of the proposed method is also compared with that of the existing methods. The analysis results show that the present method has high efficiency and very robust convergence performance and reduces the number of iterations. In addition, the proposed method can provide more efficient and numerically stable approximation of the actual force, compared with the FR method, PRP method, and VPRP method. The results validate the stability and the effectiveness of the present method, and there is reason to believe that the present method can offer a reference for future research.
Data Availability
No data were used to support this study.
Conflicts of Interest
The authors declare that they have no conflicts of interest.
Acknowledgments
This work was supported by the Chinese National Natural Science Foundation (Contract nos. 51674106 and 51274091).
References
 T. S. Jang, H. Baek, S. L. Han, and T. Kinoshita, “Indirect measurement of the impulsive load to a nonlinear system from dynamic responses: inverse problem formulation,” Mechanical Systems and Signal Processing, vol. 24, no. 6, pp. 1665–1681, 2010. View at: Publisher Site  Google Scholar
 S.J. Kim and S.K. Lee, “Experimental identification for inverse problem of a mechanical system with a nonminimum phase based on singular value decomposition,” Journal of Mechanical Science and Technology, vol. 22, no. 8, pp. 1504–1509, 2008. View at: Publisher Site  Google Scholar
 T. S. Jang, H. G. Sung, S. L. Han, and S. H. Kwon, “Inverse determination of the loading source of the infinite beam on elastic foundation,” Journal of Mechanical Science and Technology, vol. 22, no. 12, pp. 2350–2356, 2008. View at: Publisher Site  Google Scholar
 Y. Dai, L. Liu, and S. Feng, “On the identification of coupled pitch and heave motions using oppositionbased particle swarm optimization,” Mathematical Problems in Engineering, vol. 2014, Article ID 784049, 10 pages, 2014. View at: Publisher Site  Google Scholar
 B. Blaschke, A. Neubauer, and O. Scherzer, “On convergence rates for the Iteratively regularized GaussNewton method,” Ima Journal of Numerical Analysis, vol. 17, no. 3, pp. 421–436, 2018. View at: Publisher Site  Google Scholar
 J. Gao, D. Wang, and J. Peng, “A tikhonovtype regularization method for identifying the unknown source in the modified helmholtz equation,” Mathematical Problems in Engineering, vol. 2012, Article ID 878109, 13 pages, 2012. View at: Publisher Site  Google Scholar
 C.S. Liu, W. Qu, and Y. Zhang, “Numerically solving twofold illposed inverse problems of heat equation by the adjoint Trefftz method,” Numerical Heat Transfer, Part B: Fundamentals, vol. 73, no. 1, pp. 48–61, 2018. View at: Publisher Site  Google Scholar
 J. N. Franklin, “Minimum principles for illposed problems,” SIAM Journal on Mathematical Analysis, vol. 9, no. 4, pp. 638–650, 2012. View at: Google Scholar
 L. Zhang, W. Yang, C. Shen, and J. Feng, “Error bounds of Lanczos approach for trustregion subproblem,” Frontiers of Mathematics in China, vol. 13, no. 2, pp. 459–481, 2018. View at: Publisher Site  Google Scholar
 F. Stout and J. H. Kalivas, “Tikhonov regularization in standardized and general form for multivariate calibration with application towards removing unwanted spectral artifacts,” Journal of Chemometrics, vol. 20, no. 12, pp. 2223, 2006. View at: Publisher Site  Google Scholar
 A. Y. ALBayati and R. S. Muhammad, “New scaled sufficient descent conjugate gradient algorithm for solving unconstraint optimization problems,” Journal of Computer Science, vol. 6, no. 5, pp. 1953–1958, 2010. View at: Publisher Site  Google Scholar
 W. W. Hager and H. Zhang, “The limited memory conjugate gradient method,” SIAM Journal on Optimization, vol. 23, no. 4, pp. 2150–2168, 2013. View at: Publisher Site  Google Scholar
 Y. J. Wang, C. Y. Wang, and N. H. Xiu, “A family of supermemory gradient projection methods for constrained optimization,” Optimization, vol. 51, no. 6, pp. 889–905, 2002. View at: Publisher Site  Google Scholar
 K. W. Ng and A. Rohanin, “Solving optimal control problem of monodomain model using hybrid conjugate gradient methods,” Mathematical Problems in Engineering, vol. 2012, Article ID 734070, 14 pages, 2012. View at: Publisher Site  Google Scholar
 Y. Narushima and H. Yabe, “Global convergence of a memory gradient method for unconstrained optimization,” Computational Optimization and Applications, vol. 35, no. 3, pp. 325–346, 2006. View at: Publisher Site  Google Scholar
 J.B. Jian, Y.F. Zeng, and C.M. Tang, “A generalized supermemory gradient projection method of strongly subfeasible directions with strong convergence for nonlinear inequality constrained optimization,” Computers & Mathematics with Applications, vol. 54, no. 4, pp. 507–524, 2007. View at: Publisher Site  Google Scholar
 E. G. Birgin and J. M. Martinez, “A spectral conjugate gradient method for unconstrained optimization,” Applied Mathematics and Optimization, vol. 43, no. 2, pp. 117–128, 2001. View at: Publisher Site  Google Scholar
 A. Y. AlBayati and H. N. AlKhayat, “A global convergent spectral conjugate gradient method,” Australian Journal of Basic & Applied Sciences, vol. 7, no. 7, pp. 302–309, 2013. View at: Google Scholar
 C. Y. Wang and M. X. Li, “Convergence property of the FletcherReeves conjugate gradient method with errors,” Journal of Industrial & Management Optimization, vol. 1, no. 2, pp. 193–200, 2017. View at: Publisher Site  Google Scholar
 Z.J. Shi and J. Shen, “Convergence of the Polak–Ribiére–Polyak conjugate gradient method,” Nonlinear Analysis: Theory, Methods & Applications, vol. 66, no. 6, pp. 1428–1441, 2007. View at: Publisher Site  Google Scholar
 A. Qu, M. Li, Y. Xiao, and J. Liu, “A modified Polak–Ribiére–Polyak descent method for unconstrained optimization,” Optimization Methods and Software, vol. 29, no. 1, pp. 177–188, 2014. View at: Publisher Site  Google Scholar
 Y. Nakatsukasa, T. Soma, and A. Uschmajew, “Finding a lowrank basis in a matrix subspace,” Mathematical Programming, vol. 162, no. 12, pp. 325–361, 2017. View at: Publisher Site  Google Scholar
 B. Lu, Y. Cao, M. J. Yuan, and J. Zhou, “Reference variable methods of solving minmax optimization problems,” Journal of Global Optimization, vol. 42, no. 1, pp. 1–21, 2008. View at: Publisher Site  Google Scholar
 N. Andrei, “Numerical comparison of conjugate gradient algorithms for unconstrained optimization,” Studies in Informatics and Control, vol. 16, no. 4, pp. 333–352, 2007. View at: Google Scholar
 X. Dong, D. Han, Z. Dai, L. Li, and J. Zhu, “An accelerated threeterm conjugate gradient method with sufficient descent condition and conjugacy condition,” Journal of Optimization Theory and Applications, vol. 179, no. 3, pp. 944–961, 2018. View at: Publisher Site  Google Scholar
 M. Rahmati, B. Huang, L. M. Schofield et al., “Effects of Ag promotion and preparation method on cobalt FischerTropsch catalysts supported on silicamodified alumina,” Journal of Catalysis, vol. 362, pp. 118–128, 2018. View at: Publisher Site  Google Scholar
 A. Vadakkepatt, S. R. Mathur, and J. Y. Murthy, “Efficient automatic discrete adjoint sensitivity computation for topology optimization–heat conduction applications,” International Journal of Numerical Methods for Heat & Fluid Flow, vol. 28, no. 2, pp. 439–471, 2018. View at: Publisher Site  Google Scholar
 W. Zhou and X. Chen, “On the convergence of a derivativefree HS type method for symmetric nonlinear equations,” Advanced Modeling and Optimization, vol. 3, pp. 645–654, 2012. View at: Google Scholar
 X.Z. Jiang and J.B. Jian, “A sufficient descent DaiYuan type nonlinear conjugate gradient method for unconstrained optimization problems,” Nonlinear Dynamics, vol. 72, no. 12, pp. 101–112, 2013. View at: Publisher Site  Google Scholar
 L. Y. Liu and Y. Li, “Global convergence of a conjugate gradient method with strong WolfePowell line search,” Journal of Shandong University, vol. 43, no. 56, pp. 54–56, 2008. View at: Google Scholar
 J. K. Liu and Y. Y. Jiang, “Global convergence of a spectral conjugate gradient method for unconstrained optimization,” Abstract and Applied Analysis, vol. 2012, Article ID 758287, 12 pages, 2012. View at: Publisher Site  Google Scholar
 Q. Chen and X. Z. Jiang, “A spectral conjugate gradient method for unconstrained optimization,” Journal of Yulin Normal University, vol. 43, no. 2, pp. 117–128, 2016. View at: Google Scholar
 A. G. Lu, H. W. Liu, X. Zheng, and W. Cong, “A variant spectraltype FR conjugate gradient method and its global convergence,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5547–5552, 2011. View at: Publisher Site  Google Scholar
 K. R. Wang, W. Cao, and Y. H. Wang, “A spectral CD conjugate gradient method with Armijotype line search,” Journal of Shandong University, vol. 45, no. 11, pp. 104–108, 2010. View at: Google Scholar
 X. Du and J. Liu, “Global convergence of A spectral Hs conjugate gradient method,” Procedia Engineering, vol. 15, no. 56, pp. 1487–1492, 2011. View at: Publisher Site  Google Scholar
 L. Grippo and S. Lucidi, “Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method,” Optimization Methods and Software, vol. 20, no. 1, pp. 71–98, 2005. View at: Publisher Site  Google Scholar
 J. K. Liu, X. L. Du, and K. R. Wang, “A mixed spectral CDDY conjugate gradient method,” Journal and Applied Mathematics, vol. 2012, Article ID 569795, 10 pages, 2012. View at: Publisher Site  Google Scholar
 J. C. Gilbert and J. Nocedal, “Global convergence properties of conjugate gradient methods for optimization,” SIAM Journal on Optimization, vol. 2, no. 1, pp. 21–42, 1992. View at: Publisher Site  Google Scholar
 J. Liu, X. Sun, X. Han, C. Jiang, and D. Yu, “Dynamic load identification for stochastic structures based on Gegenbauer polynomial approximation and regularization method,” Mechanical Systems and Signal Processing, vol. 5657, pp. 35–54, 2015. View at: Publisher Site  Google Scholar
 C. S. Liu, C. P. Ren, and D. G. Li, “Reconstruction and deduction of cutting coal and rock load spectrum on modified discrete regularization algorithm,” Journal of China Coal Society, vol. 39, no. 5, pp. 981–986, 2014. View at: Google Scholar
 C. S. Liu, C. P. Ren, and F. Han, “Study on timefrequency spectrum characteristic of dynamic cutting load based on wavelet regularization,” Applied Mechanics and Materials, vol. 577, pp. 196–200, 2014. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2019 Nengjian Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.