On the Estimation of Sparse Hessian Matrices
From MaRDI portal
Publication:3862330
DOI10.1137/0716078zbMath0426.65025OpenAlexW2003363022WikidataQ58185993 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
symmetryalgorithmsdirect methodsubstitution methodsparsity structuresecond derivative matrixsparse Hessian matricesestimating second derivatives of a real valued function of several variables
Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Numerical differentiation (65D25)
Related Items
Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimi\-zation, A note on direct methods for approximations of sparse Hessian matrices, Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, The complexity of restricted star colouring, Recent developments in constrained optimization, Successive column correction algorithms for solving sparse nonlinear systems of equations, On the convergence of partitioning group correction algorithms, Substitution secant/finite difference method to large sparse minimax problems, Estimation of Sparse Jacobian Matrices, On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians, On the efficient computation of the nonlinear full-information maximum- likelihood estimator, Inexact smoothing method for large scale minimax optimization, Interaction solutions of the \((2+1)\)-dimensional Sawada-Kotera equation, Inexact trust region PGC method for large sparse unconstrained optimization, An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis, Approximating Hessians in unconstrained optimization arising from discretized problems, Sparse quasi-Newton updates with positive definite matrix completion, Group update method for sparse minimax problems, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, Nonmonotone adaptive trust region method based on simple conic model for unconstrained optimization, Truncated-Newton algorithms for large-scale unconstrained optimization, Pattern graph for sparse Hessian matrix determination, The substitution secant/finite difference method for large scale sparse unconstrained optimization, A chordal preconditioner for large-scale optimization, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, Optimal approximation of sparse hessians and its equivalence to a graph coloring problem, A discrete Newton algorithm for minimizing a function of many variables, Computing a sparse Jacobian matrix by rows and columns, Optimal direct determination of sparse Jacobian matrices, Estimation of sparse hessian matrices and graph coloring problems, Successive element correction algorithms for sparse unconstrained optimization
