On the public citation graph

Optimal random non-adaptive algorithm for global optimization of Brownian motion

https://doi.org/10.1007/bf00229303
0 signed · 21 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jmaa.1995.1151openalex-snapshot
Average Performance of Passive Algorithms for Global Optimization
inferredcites →https://doi.org/10.1007/978-3-662-06400-9openalex-snapshot
Continuous Martingales and Brownian Motion
inferredcites →https://doi.org/10.1016/0378-4754(92)90017-bopenalex-snapshot
Theory of global random search
inferredcites →https://doi.org/10.1016/0885-064x(90)90027-bopenalex-snapshot
Approximation and optimization on the Wiener space
inferredcites →https://doi.org/10.1017/s0021900200028709openalex-snapshot
Density factorizations for brownian motion, meander and the three-dimensional bessel process, and applications
inferredcites →https://doi.org/10.1115/1.3653121openalex-snapshot
A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise
inferredcites →https://doi.org/10.1137/1128082openalex-snapshot
A Random Walk and a Wiener Process Near a Maximum

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1099-0747(199903)15:1<77::aid-asm361>3.0.co;2-gopenalex-snapshot
Average performance of adaptive algorithms for programming co-ordinate measuring machines under budget constraint
inferred← citeshttps://doi.org/10.1007/0-306-47648-7_4openalex-snapshot
One-dimensional Global Optimization Based on Statistical Models
inferred← citeshttps://doi.org/10.1007/s10898-010-9530-zopenalex-snapshot
A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
inferred← citeshttps://doi.org/10.1016/j.engappai.2023.106207openalex-snapshot
Evolving Marine Predators Algorithm by dynamic foraging strategy for real-world engineering optimization problems
inferred← citeshttps://doi.org/10.1017/s0021900200101305openalex-snapshot
Average case behavior of random search for the maximum
inferred← citeshttps://doi.org/10.1023/a:1008308319157openalex-snapshot
Comparison of One-dimensional Composite and Non-composite Passive Algorithms
inferred← citeshttps://doi.org/10.1080/00401706.2018.1451390openalex-snapshot
Space-Filling Designs for Robustness Experiments
inferred← citeshttps://doi.org/10.1080/15326349608807389openalex-snapshot
Complexity of non–adaptive optimization algorithms for a class of diffusions
inferred← citeshttps://doi.org/10.1109/tsp.2022.3144939openalex-snapshot
Tight Regret Bounds for Noisy Optimization of a Brownian Motion
inferred← citeshttps://doi.org/10.1145/268437.268505openalex-snapshot
Comparison of Monte Carlo and deterministic methods for non-adaptive optimization
inferred← citeshttps://doi.org/10.1198/tech.2010.09157openalex-snapshot
Generalized Latin Hypercube Design for Computer Experiments
inferred← citeshttps://doi.org/10.1214/aoap/1034801250openalex-snapshot
Average performance of a class of adaptive algorithms for global optimization
inferred← citeshttps://doi.org/10.3390/a15100362openalex-snapshot
Non-Stationary Stochastic Global Optimization Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.1901.04884openalex-snapshot
Optimistic optimization of a Brownian
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.