Efficient estimation of sparse Jacobian matrices by differences
From MaRDI portal
Publication:579849
DOI10.1016/0377-0427(87)90053-7zbMath0625.65041OpenAlexW1979205434MaRDI QIDQ579849
Publication date: 1987
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-0427(87)90053-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Difference Newton-like methods under weak continuity conditions
- Convergence of Newton-like-iterative methods
- Secant methods for sparse systems of nonlinear equations with a special structure
- Convergence Theorems for Least-Change Secant Update Methods
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Local Convergence of Difference Newton-Like Methods
- Software for estimating sparse Jacobian matrices
- Local Convergence of Inexact Newton Methods
- Inexact Newton Methods
- A note on ‘new algorithms for constrained minimax optimization’
This page was built for publication: Efficient estimation of sparse Jacobian matrices by differences