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

Access Restriction
Open

 Source CiteSeerX Content type Text File Format PDF
 Age Range above 22 year Education Level UG and PG ♦ Career/Technical Study Publisher Date 2011-01-01