Pattern Search Algorithms for Bound Constrained Minimization

From MaRDI portal





The authors extend pattern search algorithms to bound constrained minimization of the form \[ \begin{aligned}\text{minimize }\quad & f(x)\\ \text{subject to }\quad & 1\leq x\leq u. \end{aligned} \] A general class of feasible point pattern search algorithms is developed and the global convergence to a Karush-Kuhn-Tucker-point is proved.




Cited in
(79)








This page was built for publication: Pattern Search Algorithms for Bound Constrained Minimization

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