Differentiating through Conjugate Gradient

Christianson, Bruce (2018) Differentiating through Conjugate Gradient. Optimization Methods and Software, 33 (4-6). pp. 988-994. ISSN 1055-6788
Copy

We show that, although the Conjugate Gradient (CG) Algorithm has a singularity at the solution, it is possible to differentiate forward through the algorithm automatically by re-declaring all the variables as truncated Taylor series, the type of active variable widely used in Automatic Differentiation (AD) tools such as ADOL-C. If exact arithmetic is used, this approach gives a complete sequence of correct directional derivatives of the solution, to arbitrary order, in a single cycle of at most n iterations, where n is the number of dimensions. In the inexact case the approach emphasizes the need for a means by which the programmer can communicate certain conditions involving derivative values directly to an AD tool.

picture_as_pdf

picture_as_pdf
CG2016_gOMS_24.pdf
subject
Submitted Version
Available under Creative Commons: BY 4.0

View Download
picture_as_pdf

Draft Version


Atom BibTeX OpenURL ContextObject in Span OpenURL ContextObject Dublin Core MPEG-21 DIDL EndNote HTML Citation METS MODS RIOXX2 XML Reference Manager Refer ASCII Citation
Export

Downloads