On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization

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

Research output: Contribution to journalArticlepeer-review

47 Downloads (Pure)

Fingerprint

Dive into the research topics of 'On the oracle complexity of first-order and derivative-free algorithms for smooth nonconvex minimization'. Together they form a unique fingerprint.

Computer Science

Mathematics