A novel method of dynamic force identification and its application
From MaRDI portal
Publication:2298083
DOI10.1155/2019/1534560zbMATH Open1435.90116OpenAlexW2996242276MaRDI QIDQ2298083FDOQ2298083
Qinhui Liu, Chunping Ren, Chunsheng Liu, Nengjian Wang
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/1534560
Recommendations
- 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
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)
Cites Work
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems
- A spectral conjugate gradient method for unconstrained optimization
- The Limited Memory Conjugate Gradient Method
- On convergence rates for the iteratively regularized Gauss-newton method
- Minimum Principles for Ill-Posed Problems
- A variant spectral-type FR conjugate gradient method and its global convergence
- A mixed spectral CD-DY conjugate gradient method
- Global convergence of a spectral conjugate gradient method for unconstrained optimization
- Finding a low-rank basis in a matrix subspace
- Global convergence of a memory gradient method for unconstrained optimization
- A Tikhonov-type regularization method for identifying the unknown source in the modified Helmholtz equation
- Convergence of the Polak-Ribiére-Polyak conjugate gradient method
- Convergence conditions, line search algorithms and trust region implementations for the Polak–Ribière conjugate gradient method
- A generalized super-memory gradient projection method of strongly sub-feasible directions with strong convergence for nonlinear inequality constrained optimization
- A Family of Supermemory Gradient Projection Methods for Constrained Optimization
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Error bounds of Lanczos approach for trust-region subproblem
- Convergence property of the Fletcher-Reeves conjugate gradient method with errors
- Reference variable methods of solving min-Max optimization problems
- Solving optimal control problem of monodomain model using hybrid conjugate gradient methods
- A modified Polak–Ribi‘ere–Polyak descent method for unconstrained optimization
- Global convergence of a conjugate gradient method with strong Wolfe-Powell line search
- On the convergence of a derivative-free HS type method for symmetric nonlinear equations
Cited In (1)
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)