On the optimal order of worst case complexity of direct search (Q276315): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/ol/DodangehVZ16, #quickstatements; #temporary_batch_1731530891435
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58040503 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-015-0908-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2189378081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Sphere by Polytopes having Few Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4435425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of zonoids by zonotopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gelfand numbers of operators with values in a Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Derivative-Free Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The blocking numbers of convex bodies / 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: On the Local Convergence of Pattern Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerated, Parallel, and Proximal Coordinate Descent / rank
 
Normal rank
Property / cites work
 
Property / cites work: EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Based on Probabilistic Descent / 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: On the distance of polytopes with few vertices to the Euclidean ball / 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 / DBLP publication ID
 
Property / DBLP publication ID: journals/ol/DodangehVZ16 / rank
 
Normal rank

Latest revision as of 21:49, 13 November 2024

scientific article
Language Label Description Also known as
English
On the optimal order of worst case complexity of direct search
scientific article

    Statements

    On the optimal order of worst case complexity of direct search (English)
    0 references
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    direct search
    0 references
    worst case complexity
    0 references
    optimal order
    0 references
    sphere covering
    0 references
    positive spanning set
    0 references
    cosine measure
    0 references

    Identifiers