On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (Q3083310): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2044207982 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:21, 19 March 2024

scientific article
Language Label Description Also known as
English
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
scientific article

    Statements

    On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (English)
    0 references
    21 March 2011
    0 references
    nonlinear optimization
    0 references
    unconstrained optimization
    0 references
    steepest-descent method
    0 references
    Newton's method
    0 references
    trust-region methods
    0 references
    cubic regularization
    0 references
    global complexity bounds
    0 references
    global rate of convergence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references