Pages that link to "Item:Q4354939"
From MaRDI portal
The following pages link to Computing Gradients in Large-Scale Optimization Using Automatic Differentiation (Q4354939):
Displaying 9 items.
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- Accurate numerical partials with applications to optimization (Q864811) (← links)
- Automatic differentiation: Parallel computation of function, gradient, and Hessian matrix (Q914328) (← links)
- Impact of partial separability on large-scale optimization (Q1363059) (← links)
- Symbiosis between linear algebra and optimization (Q1591197) (← links)
- Automatic multivector differentiation and optimization (Q2361067) (← links)
- The solution of partially separable linear equations on parallel processing systems (Q3975667) (← links)
- Geometrical/geographical optimization and fast automatic differentiation (Q3991511) (← links)
- TIME-PARALLEL COMPUTATION OF PSEUDO-ADJOINTS FOR A LEAPFROG SCHEME (Q5692260) (← links)