Direct Search Based on Probabilistic Descent (Q5502242): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1315415
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Luis Nunes Vicente / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUTEr / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2098733422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5520081 / 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: Convergence of Trust-Region Methods Based on Probabilistic Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability and Stochastics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / 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: A derivative-free nonmonotone line-search technique for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent evolution strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case complexity of direct search under convexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3224100 / 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: Concentration of Measure for the Analysis of Randomized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTEr and SifDec / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Merit Function Approach for Direct Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a method for generating points uniformly on <i>n</i> -dimensional spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random gradient-free minimization of convex functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491338 / 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: Worst case complexity of direct search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of direct searches for discontinuous functions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:22, 10 July 2024

scientific article; zbMATH DE number 6473277
Language Label Description Also known as
English
Direct Search Based on Probabilistic Descent
scientific article; zbMATH DE number 6473277

    Statements

    Direct Search Based on Probabilistic Descent (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    18 August 2015
    0 references
    derivative-free optimization
    0 references
    direct-search methods
    0 references
    polling
    0 references
    positive spanning sets
    0 references
    probabilistic descent
    0 references
    random directions
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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