Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
From MaRDI portal
Publication:5656598
Cited in
(17)- Orthogonality correction in the conjugate-gradient method
- Readily implementable conjugate gradient methods
- Conjugate gradient algorithms in nonlinear structural analysis problems
- Optimal shape of a grain or a fibre cross-section in a two-phase composite
- Nonoptimal termination properties of quadratic interpolation univariate searches
- Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations
- Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs
- A self correcting conjugate gradient algorithm
- Practical convergence conditions for unconstrained optimization
- A generalized direct search acceptable-point technique for use with descent-type multivariate algorithms
- Bending and stretching behavior of graphene structures using continuum models calibrated with modal analysis
- Convergence conditions for restarted conjugate gradient methods with inaccurate line searches
- In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization
- Alternative proofs of the convergence properties of the conjugate- gradient method
- On the calibration of size parameters related to non-classical continuum theories using molecular dynamics simulations
- Accelerating procedures for methods of conjugate directions
- A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method
This page was built for publication: Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656598)
