Conjugate grids for unconstrained optimisation

DOI10.1023/B:COAP.0000039488.79258.D7MaRDI QIDQ702470zbMATH OpenOpenAlexFDO

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

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

conjugate directionsgrid-based methodspattern searchUnconstrained optimisation

Mathematics Subject Classification ID

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

Recommendations

• On the convergence of grid-based methods for unconstrained optimization
• Frames and Grids in Unconstrained and Linearly Constrained Optimization: A Nonsmooth Approach
• A direct search conjugate directions algorithm for unconstrained minimization
• Optimization of computational grids
• Grid restrained Nelder-Mead algorithm

Cited in

(5)

• Grid solution of problem with unilateral constraints
• Performance of various BFGS implementations with limited precision second-order information
• A quasi-Newton based pattern search algorithm for unconstrained optimization
• Grid-based methods for linearly equality constrained optimization problems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q702470)