Pages that link to "Item:Q3345655"
From MaRDI portal
The following pages link to Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions (Q3345655):
Displaying 32 items.
- New Stick Number Bounds from Random Sampling of Confined Polygons (Q5056348) (← links)
- Geodesic Walks in Polytopes (Q5073522) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- GPU parameter tuning for tall and skinny dense linear least squares problems (Q5113719) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- Single Observation Adaptive Search for Continuous Simulation Optimization (Q5131547) (← links)
- Surrogate-Based Promising Area Search for Lipschitz Continuous Simulation Optimization (Q5137952) (← links)
- Black-Box Optimization: Methods and Applications (Q5153493) (← links)
- A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130) (← links)
- Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing (Q5219701) (← links)
- Efficient Simulation of High Dimensional Gaussian Vectors (Q5219708) (← links)
- An objective stepwise Bayes approach to small area estimation (Q5220802) (← links)
- Computation of Expectations by Markov Chain Monte Carlo Methods (Q5256571) (← links)
- On the mixing time of coordinate Hit-and-Run (Q5886322) (← links)
- A fast algorithm for generating a uniform distribution inside a high-dimensional polytope (Q5932766) (← links)
- Discussion on: ``Why is resorting to fate wise? A critical look at randomized algorithms in systems and control'' (Q5966130) (← links)
- Hit and Run Sampling from Tropically Convex Sets (Q5978962) (← links)
- Random generation of \(k\)-interactive capacities (Q6057910) (← links)
- Random generation of capacities and its application in comprehensive decision aiding (Q6066177) (← links)
- Probabilistic ordinal regression methods for multiple criteria sorting admitting certain and uncertain preferences (Q6096582) (← links)
- Scoring from pairwise winning indices (Q6106579) (← links)
- Approximate methods for solving chance-constrained linear programs in probability measure space (Q6142063) (← links)
- Nested sampling methods (Q6170637) (← links)
- Convergence of Gibbs sampling: coordinate hit-and-run mixes fast (Q6174808) (← links)
- On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
- Patch area and uniform sampling on the surface of any ellipsoid (Q6202797) (← links)
- Approximating income inequality dynamics given incomplete information: an upturned Markov chain model (Q6567418) (← links)
- When lattice bases are Markov bases (Q6569438) (← links)
- Tikhonov regularization as a nonparametric method for uncertainty quantification in aggregate data problems (Q6572168) (← links)
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems (Q6589568) (← links)
- Investigation of feasible and marginal operating regimes of electric power systems (Q6607896) (← links)
- Global optimization: a machine learning approach (Q6667701) (← links)
