Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization
DATE:
2023-04-25
UNIVERSAL IDENTIFIER: http://hdl.handle.net/11093/5495
EDITED VERSION: https://link.springer.com/10.1007/s10589-023-00469-0
UNESCO SUBJECT: 12 Matemáticas
DOCUMENT TYPE: article
ABSTRACT
This paper presents a class of nonmonotone Direct Search Methods that converge to stationary points of unconstrained and boxed constrained mixed-integer optimization problems. A new concept is introduced: the quasi-descent direction. A point x is stationary on a set of search directions if there exists no feasible qdd on that set. The method does not require the computation of derivatives nor the explicit manipulation of asymptotically dense matrices. Preliminary numerical experiments carried out on small to medium problems are encouraging.