On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (Q2902870): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58185697, #quickstatements; #temporary_batch_1705751991639
Created claim: DBLP publication ID (P1635): journals/siamjo/CartisGT12, #quickstatements; #temporary_batch_1731475607626
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Phillipe L. Toint / rank
Normal rank
 
Property / author
 
Property / author: Phillipe L. Toint / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ve08 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043674215 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/siamjo/CartisGT12 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:08, 13 November 2024

scientific article
Language Label Description Also known as
English
On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization
scientific article

    Statements

    On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization (English)
    0 references
    0 references
    0 references
    0 references
    22 August 2012
    0 references
    oracle complexity
    0 references
    worst-case analysis
    0 references
    finite differences
    0 references
    first-order methods
    0 references
    derivative-free optimization
    0 references
    nonconvex optimization
    0 references

    Identifiers

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