A novel method of dynamic force identification and its application
Summary: 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 Polak-Ribiere-Polyak (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.
- A mixed conjugate gradient method for unconstrained optimization
- An efficient modified PRP-FR hybrid conjugate gradient method for solving unconstrained optimization problems
- New spectral PRP conjugate gradient method for unconstrained optimization
- scientific article; zbMATH DE number 5927317
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- A mixed spectral CD-DY conjugate gradient method
- A modified Polak-Ribière-Polyak descent method for unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- A Tikhonov-type regularization method for identifying the unknown source in the modified Helmholtz equation
- A variant spectral-type FR conjugate gradient method and its global convergence
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- Convergence property of the Fletcher-Reeves conjugate gradient method with errors
- Error bounds of Lanczos approach for trust-region subproblem
- Finding a low-rank basis in a matrix subspace
- Global convergence of a conjugate gradient method with strong Wolfe-Powell line search
- Global convergence of a memory gradient method for unconstrained optimization
- Global convergence of a spectral conjugate gradient method for unconstrained optimization
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Minimum Principles for Ill-Posed Problems
- On convergence rates for the iteratively regularized Gauss-newton method
- On the convergence of a derivative-free HS type method for symmetric nonlinear equations
- Reference variable methods of solving min-Max optimization problems
- Solving optimal control problem of monodomain model using hybrid conjugate gradient methods
- The Limited Memory Conjugate Gradient Method
This page was built for publication: A novel method of dynamic force identification and its application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298083)
