A matrix-free exact Newton method
type: Item
instance of: scholarly article
title: A matrix-free exact Newton method
author: Uwe Naumann
published in: SIAM Journal on Scientific Computing
publication date: 2024-05-07T00:00:00Z
Mathematics Subject Classification ID: 49M15
Mathematics Subject Classification ID: 47A05
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 7843967
zbMATH Keywords: Newton method
zbMATH Keywords: matrix-free
zbMATH Keywords: algorithmic differentiation
zbMATH Keywords: adjoint
zbMATH Keywords: machine learning
zbMATH Keywords: surrogate model
MaRDI profile type: MaRDI publication profile
cites work: The complexity of partial derivatives
cites work: Advances in automatic differentiation. Selected papers based on the presentations at the 5th international conference on automatic differentiation, Bonn, Germany, August 11--15, 2008
cites work: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
cites work: Truncated-Newton algorithms for large-scale unconstrained optimization
cites work: Q4818644
cites work: Q3740904
cites work: Q4198056
cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
cites work: Collected matrix derivative results for forward and reverse mode algorithmic differentiation
cites work: Q5689624
cites work: Deep learning
cites work: Algorithm 755: ADOL-C
cites work: Accumulating Jacobians as chained sparse matrix products
cites work: Evaluating Derivatives
cites work: Methods of conjugate gradients for solving linear systems
cites work: Fast reverse-mode automatic differentiation using expression templates in C++
cites work: Solving Nonlinear Equations with Newton's Method
cites work: Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
cites work: The elimination form of the inverse and its application to linear programming
cites work: Call tree reversal is NP-complete
cites work: Optimal Jacobian accumulation is NP-complete
cites work: DAG reversal is NP-complete
cites work: The art of differentiating computer programs. An introduction to algorithmic differentiation.
cites work: Algorithmic differentiation of numerical methods: tangent and adjoint solvers for parameterized systems of nonlinear equations
cites work: The NP-completeness of the bandwidth minimization problem
cites work: Algorithmic Aspects of Vertex Elimination on Directed Graphs
cites work: High-performance derivative computations using CoDiPack
cites work: Multistage approaches for optimal offline checkpointing
cites work: Minimal Repetition Dynamic Checkpointing Algorithm for Unsteady Adjoint Calculation
DOI: 10.1137/23M157017X
Recommended article: A matrix-free approach for solving systems of nonlinear equations
Recommended article: Q4251294
Recommended article: Jacobian computation-free Newton's method for systems of nonlinear equations
Recommended article: Q3348723
Recommended article: An inexact Newton method for systems arising from the finite element method
description: scientific article; zbMATH DE number 7843967