Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(eps^{-2}) rather than O(eps^{-2})

Serge Gratton, Chee_Khian Sim, Philippe Toint

Research output: Working paper

65 Downloads (Pure)

Fingerprint

Dive into the research topics of 'Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is o(eps^{-2}) rather than O(eps^{-2})'. Together they form a unique fingerprint.

INIS

Keyphrases

Mathematics