Worst case complexity of direct search (Q743632): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s13675-012-0003-7 / rank
Normal rank
 
Property / author
 
Property / author: Q245491 / rank
Normal rank
 
Property / author
 
Property / author: Luis Nunes Vicente / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s13675-012-0003-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041322191 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Generalized Pattern Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization / 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 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: On the Oracle Complexity of First-Order and Derivative-Free Algorithms for Smooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local Convergence of Pattern Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and worst-case complexity for direct-search methods in nonsmooth optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive Formula-trust-region method for bound-constrained nonlinear 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: Q4435425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Search Methods for Linearly Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introductory lectures on convex optimization. A basic course. / 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: On the Convergence of Pattern Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of direct searches for discontinuous functions / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S13675-012-0003-7 / rank
 
Normal rank

Latest revision as of 03:47, 10 December 2024

scientific article
Language Label Description Also known as
English
Worst case complexity of direct search
scientific article

    Statements

    Worst case complexity of direct search (English)
    0 references
    30 September 2014
    0 references
    derivative-free optimization
    0 references
    direct search
    0 references
    worst case complexity
    0 references
    sufficient decrease
    0 references
    0 references

    Identifiers