Pages that link to "Item:Q3026740"

The following pages link to Hit-and-run algorithms for the identification of nonredundant linear inequalities (Q3026740):

Displaying 26 items.

• Constraint classification in mathematical programming (Q689150) (← links)
• Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints (Q716749) (← links)
• Local tests for consistency of support hyperplane data. (Q960495) (← links)
• A new approach to the analysis of random methods for detecting necessary linear inequality constraints (Q1123120) (← links)
• Bayesian approach to global optimization and application to multiobjective and constrained problems (Q1176841) (← links)
• Pure adaptive search in global optimization (Q1184353) (← links)
• On the best case performance of hit and run methods for detecting necessary constraints (Q1186280) (← links)
• New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
• Geometry of optimal value functions with applications to redundancy in linear programming (Q1331104) (← links)
• Simulated annealing for constrained global optimization (Q1337127) (← links)
• Computing and estimating the volume of the solution space of SMT(LA) constraints (Q1659994) (← links)
• Slow hit-and-run sampling (Q1975350) (← links)
• \(t\)-copula from the viewpoint of tail dependence matrices (Q2146466) (← links)
• Improving hit-and-run for global optimization (Q2366968) (← links)
• A soft approach for hard continuous optimization (Q2491765) (← links)
• Bayesian stopping rules for multistart global optimization methods (Q3030595) (← links)
• A weighted belief-propagation algorithm for estimating volume-related properties of random polytopes (Q3301299) (← links)
• A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
• Probabilistic algorithms for extreme point identification (Q3508860) (← links)
• Pattern search in the presence of degenerate linear constraints (Q3514838) (← links)
• Pure Random Search with exponential rate of convergency (Q3553768) (← links)
• Shake-and-bake algorithms for the identification of nonredundant linear inequalities (Q3978340) (← links)
• Slow convergence of the Gibbs sampler (Q4243790) (← links)
• Discovering the Characteristics of Mathematical Programs via Sampling (Q4806377) (← links)
• Black-Box Optimization: Methods and Applications (Q5153493) (← links)
• Customer satisfaction in the presence of imperfect knowledge of data (Q6079909) (← links)