A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (Q5299905): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q816576
Created claim: Wikidata QID (P12): Q58185673, #quickstatements; #temporary_batch_1721913393134
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Phillipe L. Toint / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2012.722632 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2146893335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity bounds for second-order optimality in unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Trust-Region Methods for Multiscale Nonlinear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nesterov's nonsmooth Chebyshev-Rosenbrock functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic regularization of Newton method and its global performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Black-Box Complexity of Local Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58185673 / rank
 
Normal rank

Latest revision as of 15:35, 25 July 2024

scientific article; zbMATH DE number 6179987
Language Label Description Also known as
English
A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function
scientific article; zbMATH DE number 6179987

    Statements

    A note about the complexity of minimizing Nesterov's smooth Chebyshev–Rosenbrock function (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    evaluation complexity
    0 references
    worst-case analysis
    0 references
    nonconvex optimization
    0 references
    0 references
    0 references