Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
From MaRDI portal
Publication:4162403
DOI10.2307/2006489zbMath0381.65036OpenAlexW4234591907WikidataQ58186002 ScholiaQ58186002MaRDI QIDQ4162403
Publication date: 1978
Full work available at URL: https://doi.org/10.2307/2006489
Related Items
A new direct search method based on separable fractional interpolation model, On Variable-Metric Methods for Sparse Hessians, Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space, A compact limited memory method for large scale unconstrained optimization, Unnamed Item, A derivative-free algorithm for linearly constrained optimization problems, A Derivative-Free Nonlinear Least Squares Solver, On the steplength selection in gradient methods for unconstrained optimization, Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds, An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis, On diagonally structured problems in unconstrained optimization using an inexact super Halley method, On the limited memory BFGS method for large scale optimization, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Damped techniques for the limited memory BFGS method for large-scale optimization, Optimization of unconstrained functions with sparse hessian matrices-newton-type methods, Steplength selection in gradient projection methods for box-constrained quadratic programs, Truncated-Newton algorithms for large-scale unconstrained optimization, A limited memory steepest descent method, Backward Step Control for Global Newton-Type Methods, Bibliography on the evaluation of numerical software, A chordal preconditioner for large-scale optimization, Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables, Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods, QN-like variable storage conjugate gradients, Scaled optimal path trust-region algorithm, Recent advances in trust region algorithms
Cites Work
- Unnamed Item
- Unified approach to quadratically convergent algorithms for function minimization
- Quasi-Newton Methods, Motivation and Theory
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- A Rapidly Convergent Descent Method for Minimization
- Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
- A New Algorithm for Unconstrained Optimization
