Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
From MaRDI portal
Publication:3324531
DOI10.1007/BF02592219zbMath0538.49023MaRDI QIDQ3324531
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items
A note on direct methods for approximations of sparse Hessian matrices, The Null Space Problem II. Algorithms, A chordal preconditioner for large-scale optimization, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, Estimation of sparse hessian matrices and graph coloring problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- On the Estimation of Sparse Hessian Matrices
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Inexact Newton Methods
- Newton’s Method with a Model Trust Region Modification
- Newton-type methods for unconstrained and linearly constrained optimization
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- Partial Elimination
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- A class of first order factorization methods
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
