On the Estimation of Sparse Hessian Matrices
From MaRDI portal
Publication:3862330
DOI10.1137/0716078zbMath0426.65025WikidataQ58185993 ScholiaQ58185993MaRDI QIDQ3862330
M. J. D. Powell, Phillipe L. Toint
Publication date: 1979
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0716078
symmetry; algorithms; direct method; substitution method; sparsity structure; second derivative matrix; sparse Hessian matrices; estimating second derivatives of a real valued function of several variables
90C30: Nonlinear programming
65K10: Numerical optimization and variational techniques
49M15: Newton-type methods
65D25: Numerical differentiation
Related Items
The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, On the convergence of partitioning group correction algorithms, Sparse quasi-Newton updates with positive definite matrix completion, Recent developments in constrained optimization, Successive column correction algorithms for solving sparse nonlinear systems of equations, On the efficient computation of the nonlinear full-information maximum- likelihood estimator, An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis, A chordal preconditioner for large-scale optimization, Successive element correction algorithms for sparse unconstrained optimization, Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation, The substitution secant/finite difference method for large scale sparse unconstrained optimization, Truncated-Newton algorithms for large-scale unconstrained optimization, Estimation of Sparse Jacobian Matrices, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, Estimation of sparse hessian matrices and graph coloring problems, Unnamed Item, A discrete Newton algorithm for minimizing a function of many variables, Computing a sparse Jacobian matrix by rows and columns
