Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (Q2184405): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: YiJun Zuo / rank
Normal rank
 
Property / author
 
Property / author: YiJun Zuo / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: R / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LBFGS-B / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00180-019-00906-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2950141511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Limited Memory Algorithm for Bound Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interacting multiple try algorithms with different proposal distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute approximation of Tukey depth: theory and experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The random Tukey depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On robust classification using projection depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact computation of the halfspace depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo sampling methods using Markov chains and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast nonparametric classification based on data depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated Stochastic Approximation Annealing for Global Optimization With a Square-Root Cooling Schedule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo strategies in scientific computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast implementation of the Tukey depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Try Method and Local Optimization in Metropolis Sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Halfspace Depth and Regression Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite sample breakdown point of Tukey's halfspace median / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-point Metropolis scheme with generic weight functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplex Method for Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regression Depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3376534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple-try simulated annealing algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for higher dimensional projection depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for the bounds of Kendall's τ and Spearman's ρ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: General notions of statistical depth function. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:07, 22 July 2024

scientific article
Language Label Description Also known as
English
Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
scientific article

    Statements

    Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (English)
    0 references
    0 references
    0 references
    28 May 2020
    0 references
    half-space depth computation
    0 references
    multiple try Metropolis
    0 references
    simulated annealing
    0 references
    Markov chain Monte Carlo (MCMC)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers