Efficient calculation of regular simplex gradients (Q2419521): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128454087, #quickstatements; #temporary_batch_1723648593707
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963756096 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.01427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Search Methods for User-Provided Points: Application to Molecular Geometry Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative-Free and Blackbox Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4701106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using simplex gradients of nonsmooth functions in direct search methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Sampling and Simplex Derivatives in Pattern Search Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Positive Linear Dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Methods on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Direct Search'' Solution of Numerical and Statistical Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4076683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4237537 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Search Algorithms for Bound Constrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two minimal positive bases based direct search conjugate gradient methods for computationally expensive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex Method for Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684176 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A convergent variant of the Nelder--Mead algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The calculus of simplex gradients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Simplices and Quadratic Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Application of Simplex Designs in Optimisation and Evolutionary Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Multidirectional Search Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3574013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Richardson extrapolation. Practical aspects and applications / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128454087 / rank
 
Normal rank

Latest revision as of 17:33, 14 August 2024

scientific article
Language Label Description Also known as
English
Efficient calculation of regular simplex gradients
scientific article

    Statements

    Efficient calculation of regular simplex gradients (English)
    0 references
    0 references
    0 references
    13 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    positive bases
    0 references
    numerical optimization
    0 references
    derivative free optimization
    0 references
    regular simplex
    0 references
    simplex gradient
    0 references
    least squares
    0 references
    well poised
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references