Conjugate gradient algorithms in nonlinear structural analysis problems
Publication:1077990
DOI10.1016/0045-7825(86)90021-6zbMath0595.73097OpenAlexW2038237894MaRDI QIDQ1077990
Panaghiotis Ghionis, Manolis Papadrakakis
Publication date: 1986
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(86)90021-6
algorithmconjugate gradient algorithmscalingconvergence propertiessymmetricPerrynonlinear structural analysisline search techniquesBoland-Kamgnia-Kowalik algorithmfalseKlessig-Polak techniqueNazareth algorithmone-variable minimization routineposition-bisection techniquepositive-definite Jacobiansets of nonlinear equationssparse, symmetric, and
Related Items (6)
Cites Work
- Unnamed Item
- A method for the automatic evaluation of the dynamic relaxation parameters
- A conjugate direction algorithm without line searches
- A conjugate-gradient optimization method invariant to nonlinear scaling
- Comparison of some conjugate direction procedures for function minimization
- Post-buckling analysis of spatial structures by vector iteration methods
- A family of methods with three-term recursion formulae
- A self correcting conjugate gradient algorithm
- Function minimization by conjugate gradients
- Computational experience with quadratically convergent minimisation methods
- On Steepest Descent
- Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
This page was built for publication: Conjugate gradient algorithms in nonlinear structural analysis problems