Approximating Hessians in unconstrained optimization arising from discretized problems
type: Item
instance of: scholarly article
title: Approximating Hessians in unconstrained optimization arising from discretized problems
zbMATH Open document ID: 1228.90117
author: Vincent Malmedy
author: Philippe L. Toint
published in: Computational Optimization and Applications
publication date: 2011-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 5969573
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: discretized problems
zbMATH Keywords: sparsity
zbMATH Keywords: partial separability
zbMATH Keywords: numerical experiences
Wikidata QID: Q58185748
describes a project that uses: LANCELOT
describes a project that uses: ve08
describes a project that uses: tn
MaRDI profile type: Publication
full work available at URL: s10589-010-9317-7
OpenAlex ID: W2019071950
cites work: The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
cites work: Q3707252
cites work: Estimation of sparse hessian matrices and graph coloring problems
cites work: Q4023146
cites work: Q5180766
cites work: Q3702408
cites work: Benchmarking optimization software with performance profiles.
cites work: A new approach to variable metric algorithms
cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
cites work: A Family of Variable-Metric Methods Derived by Variational Means
cites work: Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
cites work: Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
cites work: A recursive Formula-trust-region method for bound-constrained nonlinear optimization
cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
cites work: Q3474197
cites work: Q3677522
cites work: Partitioned variable metric updates for large structured optimization problems
cites work: Computing a sparse Jacobian matrix by rows and columns
cites work: Q4660694
cites work: A multigrid approach to discretized optimization problems
cites work: A survey of truncated-Newton methods
cites work: Numerical Optimization
cites work: On the Estimation of Sparse Hessian Matrices
cites work: Conditioning of Quasi-Newton Methods for Function Minimization
cites work: On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
cites work: On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
cites work: A note about sparsity exploiting quasi-Newton updates
DOI: 10.1007/S10589-010-9317-7
description: scientific article; zbMATH DE number 5969573