Skip to main navigation Skip to search Skip to main content

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

Research output: Contribution to journalArticlepeer-review

95 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.
Sort by

Keyphrases

Mathematics

Engineering

INIS