Conjugate grids for unconstrained optimisation

DOI10.1023/B:COAP.0000039488.79258.D7zbMath1062.90063OpenAlexW2034155318MaRDI QIDQ702470

D. Byatt, Price, C. J., Ian D. Coope

Publication date: 17 January 2005

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:coap.0000039488.79258.d7

zbMATH Keywords

pattern searchconjugate directionsgrid-based methodsUnconstrained optimisation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (3)

A quasi-Newton based pattern search algorithm for unconstrained optimization ⋮ Performance of various BFGS implementations with limited precision second-order information ⋮ A new quasi-Newton pattern search method based on symmetric rank-one update for unconstrained optimization

This page was built for publication: Conjugate grids for unconstrained optimisation