On Variable-Metric Methods for Sparse Hessians
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Family of Variable-Metric Methods Derived by Variational Means
- A New Algorithm for Unconstrained Optimization
- A Rapidly Convergent Descent Method for Minimization
- A combined conjugate-gradient quasi-Newton minimization algorithm
- A new approach to variable metric algorithms
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Conditioning of Quasi-Newton Methods for Function Minimization
- Conjugate Gradient Methods with Inexact Searches
- Generating conjugate directions without line searches using factorized variable metric updating formulas
- Least Change Secant Updates for Quasi-Newton Methods
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- Numerical comparison of several variable metric algorithms
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On the use of directions of negative curvature in a modified newton method
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Testing Unconstrained Optimization Software
- The Convergence of a Class of Double-rank Minimization Algorithms
- Variations on Variable-Metric Methods
Cited in
(19)- Global convergence of Schubert's method for solving sparse nonlinear equations
- A sparse sequential quadratic programming algorithm
- The application of optimal control methodology to nonlinear programming problems
- A Sparse Quasi-Newton Update Derived Variationally with a Nondiagonally Weighted Frobenius Norm
- A quasi-Newton based pattern search algorithm for unconstrained optimization
- Computational experience with methods for estimating sparse hessians for nonlinear optimization
- A note about sparsity exploiting quasi-Newton updates
- Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms
- Some computational advances in unconstrained optimization
- A review of the optimal power flow
- Updating Quasi-Newton Matrices with Limited Storage
- A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods
- Partitioned variable metric updates for large structured optimization problems
- On the generation of updates for quasi-Newton methods
- Long vectors for quasi-Newton updates
- A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization
- A quasi-Newton method with sparse triple factorization for unconstrained minimization
- A Kantorovich theorem for the structured PSB update in Hilbert space.
This page was built for publication: On Variable-Metric Methods for Sparse Hessians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3859198)
