Differentiating through Conjugate Gradient
                
    Christianson, Bruce
  
(2018)
Differentiating through Conjugate Gradient.
    Optimization Methods and Software, 33 (4-6).
     pp. 988-994.
     ISSN 1055-6788
  
  
              
            
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.
| Item Type | Article | 
|---|---|
| Identification Number | 10.1080/10556788.2018.1425862 | 
| Additional information | This is the pre-print version of an article published by Taylor & Francis in Optimization Methods and Software on 6 January 2018, available online at: https://doi.org/10.1080/10556788.2018.1425862. | 
| Keywords | automatic differentiation, taylor series, conjugate gradient, software, control and optimization, applied mathematics | 
| Date Deposited | 15 May 2025 13:38 | 
| Last Modified | 11 Sep 2025 00:11 | 
				Downloads
			  
			  ?
                    Total file downloads from UHRA since January 2020. For more information on metrics see the IRUS guide.
                  