Approximating Hessians in unconstrained optimization arising from discretized problems
From MaRDI portal
Publication:645548
DOI10.1007/s10589-010-9317-7zbMath1228.90117OpenAlexW2019071950WikidataQ58185748 ScholiaQ58185748MaRDI QIDQ645548
Vincent Malmedy, Phillipe L. Toint
Publication date: 8 November 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-010-9317-7
Related Items
Uses Software
Cites Work
- Partitioned variable metric updates for large structured optimization problems
- A survey of truncated-Newton methods
- Optimal Estimation of Jacobian and Hessian Matrices That Arise in Finite Difference Calculations
- A recursive Formula-trust-region method for bound-constrained nonlinear optimization
- Numerical experience with a recursive trust-region method for multilevel nonlinear bound-constrained optimization
- Recursive Trust-Region Methods for Multiscale Nonlinear Optimization
- Estimation of sparse hessian matrices and graph coloring problems
- On the Superlinear Convergence of an Algorithm for Solving a Sparse Minimization Problem
- On the Estimation of Sparse Hessian Matrices
- A note about sparsity exploiting quasi-Newton updates
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Computing a sparse Jacobian matrix by rows and columns
- Numerical Optimization
- A multigrid approach to discretized optimization problems
- A Family of Variable-Metric Methods Derived by Variational Means
- A new approach to variable metric algorithms
- The Convergence of a Class of Double-rank Minimization Algorithms 1. General Considerations
- Conditioning of Quasi-Newton Methods for Function Minimization
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
