Successive element correction algorithms for sparse unconstrained optimization

DOI10.1007/BF00940448zbMath0796.90057MaRDI QIDQ1321350

V. Pereyra

Publication date: 26 September 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

symmetryunconstrained optimizationapproximate Hessiansparsitysecant modificationsuccessive element correction algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

Inexact trust region PGC method for large sparse unconstrained optimization

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Successive column correction algorithms for solving sparse nonlinear systems of equations
• Memory gradient method for the minimization of functions
• Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
• Software for estimating sparse Jacobian matrices
• Estimation of sparse hessian matrices and graph coloring problems
• On the Estimation of Sparse Hessian Matrices
• Testing Unconstrained Optimization Software
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation

This page was built for publication: Successive element correction algorithms for sparse unconstrained optimization