Hessian Matrix vs. Gauss–Newton Hessian Matrix

DOI10.1137/100799988MaRDI QIDQ3097463zbMATH OpenOpenAlexFDO

Authors Pei Chen

Publication date 10 November 2011

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/100799988

zbMATH Keywords

convergencenumerical examplesLevenberg-Marquardt methodNewton-type methodsnonlinear least squares problemGauss-Newton Hessian matrixnonnegative convex quadratic approximation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of quasi-Newton type (90C53)

Recommendations

• The Hessian matrix of Lagrange function
• Efficient calculation of the Gauss-Newton approximation of the Hessian matrix in neural networks
• A new framework for the computation of Hessians
• Structure of the Hessian matrix and an economical implementation of Newton's method in the problem of canonical approximation of tensors
• The hessian in funtion minization
• Application of Newton's method in the case of sign-indefinite Hesse matrix
• Fast approximation of the Gauss-Newton Hessian matrix for the multilayer perceptron
• The Hessian discriminant
• Numerical comparison of some Hessian recovery techniques
• scientific article; zbMATH DE number 5666384

Cited in

(10)

• Statistical Finite Elements via Langevin Dynamics
• scientific article; zbMATH DE number 7306852 (Why is no real title available?)
• Robust federated learning under statistical heterogeneity via hessian-weighted aggregation
• A search grid for parameter optimization as a byproduct of model sensitivity analysis
• A robust and informative method for solving large-scale power flow problems
• Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems
• Relative Sizes of the Hessian Terms in Nonlinear Parameter Estimation
• Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
• Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems
• Theoretical and Numerical Study of Iteratively Truncated Newton’s Algorithm

This page was built for publication: Hessian Matrix vs. Gauss–Newton Hessian Matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3097463)