Efficient Implementations of the Polak–Ribière Conjugate Gradient Algorithm

DOI10.1137/0310040zbMath0244.90034OpenAlexW2055012255MaRDI QIDQ5656598

No author found.

Publication date: 1972

Published in: SIAM Journal on Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0310040

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55) Mathematical programming (90C99)

Related Items

Conjugate gradient algorithms in nonlinear structural analysis problems, 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, Practical convergence conditions for unconstrained optimization, Convergence conditions for restarted conjugate gradient methods with inaccurate line searches, On the calibration of size parameters related to non-classical continuum theories using molecular dynamics simulations, Optimal shape of a grain or a fibre cross-section in a two-phase composite, Accelerating procedures for methods of conjugate directions, Function-space quasi-Newton algorithms for optimal control problems with bounded controls and singular arcs, Readily implementable conjugate gradient methods, Nonoptimal termination properties of quadratic interpolation univariate searches, A self correcting conjugate gradient algorithm, In favor of conjugate directions: a generalized acceptable-point algorithm for function minimization, Conjugate gradient algorithms in the solution of optimization problems for nonlinear elliptic partial differential equations, A derivative-based bracketing scheme for univariate minimization and the conjugate gradient method, Alternative proofs of the convergence properties of the conjugate- gradient method, Orthogonality correction in the conjugate-gradient method