📣 Try out the NEW Gateway to Research and let us know what you think.

We're looking for users to test the new service during August and September and share their feedback. Express your interest by completing this short form.

Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization (2012)

First Author: Cartis C

Attributed to: Algorithms and Software for Large-Scale Sparse or Structured Systems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1080/10556788.2011.602076

Publication URI: http://dx.doi.org/10.1080/10556788.2011.602076

Type: Journal Article/Review

Parent Publication: Optimization Methods and Software

Issue: 2