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

Philippe Toint, Coralia Cartis, N. I. M. Gould

Research output: Contribution to journalArticlepeer-review

49 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints'. Together they form a unique fingerprint.

Computer Science