no code implementations • 3 Nov 2018 • Coralia Cartis, Nick I. M. Gould, Philippe L. Toint
We provide sharp worst-case evaluation complexity bounds for nonconvex minimization problems with general inexpensive constraints, i. e.\ problems where the cost of evaluating/enforcing of the (possibly nonconvex or even disconnected) constraints, if any, is negligible compared to that of evaluating the objective function.