On the best case performance of hit and run methods for detecting necessary constraints

DOI10.1007/BF01586052zbMATH Open0746.65053OpenAlexW2015181134MaRDI QIDQ1186280FDOQ1186280

Authors: Richard J. Caron, M. Hlynka, J. Fred McDonald 

Publication date: 28 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586052

Recommendations

• Convergence properties of hit–and–run samplers
• A new approach to the analysis of random methods for detecting necessary linear inequality constraints
• scientific article; zbMATH DE number 1163814
• Hit-and-run mixes fast
• Hit-and-Run Algorithms for Generating Multivariate Distributions

zbMATH Keywords

linear inequalitiesredundancysampling problemsstatistical performanceprobabilistic algorithmscoupon collector's problemnumber of iterationssystems of linear constraintshit and run methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05)

Cites Work

• Title not available (Why is that?)
• Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra
• A new approach to the analysis of random methods for detecting necessary linear inequality constraints
• On the best case performance of hit and run methods for detecting necessary constraints
• The coupon-collector problem revisited — a survey of engineering problems and computational methods
• Redundancy in mathematical programming. A state-of-the-art survey
• Hit-and-run algorithms for the identification of nonredundant linear inequalities

Cited In (9)

• Monte Carlo Algorithms for the Detection of Necessary Linear Matrix Inequality Constraints
• Optimal strategy of coupon subset collection when each package contains half of the coupons
• A new approach to the analysis of random methods for detecting necessary linear inequality constraints
• On the best case performance of hit and run methods for detecting necessary constraints
• Notes on ``Hit-and-run enables efficient weight generation for simulation-based multiple criteria decision analysis
• Results and conjectures on the role of the uniform distribution in the coupon collector's problem with group drawings
• Minimal representation of convex regions defined by analytic functions
• Hit-and-run algorithms for feasibility and detection of necessary linear matrix inequality constraints
• Probabilistic algorithms for extreme point identification

This page was built for publication: On the best case performance of hit and run methods for detecting necessary constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186280)