A platform for research: civil engineering, architecture and urbanism
Exploiting Band Structure in Unconstrained Optimization Without Derivatives
Abstract This paper is concerned with derivative-free unconstrained optimization. We first discuss a method combining the use of interpolation polynomials and trust-region techniques to minimize a function whose derivatives are not available. We then show how the resulting algorithm may be adapted in a suitable way to consider problems for which the Hessian matrix is known to be sparse. Numerical experiments confirm the favourable behaviour of the method and in particular the advantages in terms of storage, function evaluations and speed.
Exploiting Band Structure in Unconstrained Optimization Without Derivatives
Abstract This paper is concerned with derivative-free unconstrained optimization. We first discuss a method combining the use of interpolation polynomials and trust-region techniques to minimize a function whose derivatives are not available. We then show how the resulting algorithm may be adapted in a suitable way to consider problems for which the Hessian matrix is known to be sparse. Numerical experiments confirm the favourable behaviour of the method and in particular the advantages in terms of storage, function evaluations and speed.
Exploiting Band Structure in Unconstrained Optimization Without Derivatives
Colson, Benoît (author) / Toint, Philippe L. (author)
Optimization and Engineering ; 2 ; 399-412
2001-12-01
14 pages
Article (Journal)
Electronic Resource
English
Exploiting Band Structure in Unconstrained Optimization Without Derivatives
Online Contents | 2001
|Springer Verlag | 1992
|Springer Verlag | 1990
|Step size rule for unconstrained optimization
TIBKAT | 1992
|An unconstrained optimization approach to the split feasibility problem
British Library Online Contents | 2017
|