A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives

DOI10.1145/355637.355638MaRDI QIDQ4058043zbMATH OpenOpenAlexWikidataFDO

Authors M. J. D. Powell

Publication date 1975

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/355637.355638

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mathematical programming (90Cxx)

Cited in

(12)

• A comparison of some algorithms for the nonlinear least squares problem
• Bibliography on the evaluation of numerical software
• Derivative-free optimization methods
• An assessment of two approaches to variable metric methods
• Revision of a Derivative-Free Quasi-Newton Method
• MERLIN-3. 0. A multidimensional optimization environment
• An algorithm for minimizing a differentiable function subject to box constraints and errors
• Some remarks on the symmetric rank-one update
• A numerically stable optimization method based on A homogeneous function
• A Homotopy based approach to unconstrained optimization
• An optimal interpolation set for model-based derivative-free optimization methods
• Recent progress in unconstrained nonlinear optimization without derivatives

This page was built for publication: A View of Unconstrained Minimization Algorithms that Do Not Require Derivatives

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