On the Local Convergence of Pattern Search

From MaRDI portal





The authors consider local convergence properties of pattern search as a class of direct search methods for solving nonlinear programming problems. For simplicity, only the unconstrained case \(\min_{x\in\mathbb{R}^n}\,f(x)\) is considered. Numerical tests are given.




Cited in
(38)








This page was built for publication: On the Local Convergence of Pattern Search

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