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

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...

Celý popis

Podrobná bibliografie
Hlavní autoři: Cartis, C, Gould, N, Toint, P
Médium: Journal article
Jazyk:English
Vydáno: Society for Industrial and Applied Mathematics 2020

Podobné jednotky