Exploring stochasticity and imprecise knowledge based on linear inequality constraints
From MaRDI portal
Publication:314508
DOI10.1007/s00285-015-0959-zzbMath1346.92079OpenAlexW2222645259WikidataQ46613316 ScholiaQ46613316MaRDI QIDQ314508
Sam Subbey, Benjamin Planque, Ulf Lindström
Publication date: 16 September 2016
Published in: Journal of Mathematical Biology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00285-015-0959-z
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Time varying VARs with inequality restrictions
- A Bayesian method for linear, inequality-constrained adjustment and its application to GPS positioning
- Testing inequality constraints in linear econometric models
- General hit-and-run Monte Carlo sampling for evaluating multidimensional integrals
- Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
- Hit-and-run mixes fast
- Monte Carlo methods in Bayesian computation
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
- Handbook of Monte Carlo Methods
- A Laplace transform algorithm for the volume of a convex polytope
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Volume Computation Using a Direct Monte Carlo Method
- On the Complexity of Computing the Volume of a Polyhedron
- Convergence properties of hit–and–run samplers
- Numerical Optimization
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Inequality Restrictions in Regression Analysis
- Gaussian polytopes: variances and limit theorems
This page was built for publication: Exploring stochasticity and imprecise knowledge based on linear inequality constraints
