Search Results for author: Nick I. M. Gould

Found 1 papers, 0 papers with code

Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints

no code implementations3 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.