Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文(繁體)
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
An adaptive cubic regularizat...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
An adaptive cubic regularization algorithm for nonconvex optimization with convex constraints and its function-evaluation complexity
Bibliographic Details
Main Authors:
Cartis, C
,
Gould, N
,
Toint, P
Format:
Journal article
Published:
2012
Holdings
Description
Similar Items
Staff View
Similar Items
Evaluation complexity of adaptive cubic regularization methods for convex unconstrained optimization.
by: Cartis, C, et al.
Published: (2012)
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems.
by: Cartis, C, et al.
Published: (2010)
Sharp worst-case evaluation complexity bounds for arbitrary-order nonconvex optimization with inexpensive constraints
by: Cartis, C, et al.
Published: (2020)
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization.
by: Cartis, C, et al.
Published: (2012)
Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization
by: Cartis, C, et al.
Published: (2018)