Pages that link to "Item:Q5894078"

The following pages link to Solving convex programs by random walks (Q5894078):

Displaying 38 items.

• Randomized interior point methods for sampling and optimization (Q259600) (← links)
• Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
• Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
• Randomized methods based on new Monte Carlo schemes for control and optimization (Q666376) (← links)
• Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
• Monte Carlo method of batch iterations: probabilistic characteristics (Q747227) (← links)
• On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
• Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
• Integer convex minimization by mixed integer linear optimization (Q1785273) (← links)
• A stochastic subspace approach to gradient-free optimization in high dimensions (Q2044475) (← links)
• An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs (Q2352416) (← links)
• An empirical evaluation of walk-and-round heuristics for mixed integer linear programs (Q2393650) (← links)
• Random gradient-free minimization of convex functions (Q2397749) (← links)
• On the symmetry function of a convex set (Q2467164) (← links)
• Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
• Sampling from the complement of a polyhedron: an MCMC algorithm for data augmentation (Q2661558) (← links)
• Centerpoints: A Link Between Optimization and Convex Geometry (Q3186488) (← links)
• Efficient Convex Optimization with Oracles (Q3295271) (← links)
• Sampling Hypersurfaces through Diffusion (Q3541818) (← links)
• (Q4558208) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• Multidimensional Binary Search for Contextual Decision-Making (Q4971566) (← links)
• On the Complexity of Constrained Determinantal Point Processes (Q5002639) (← links)
• A Hit‐and‐Run approach for generating scale invariant Small World networks (Q5191130) (← links)
• (Q5219717) (← links)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
• Morphological Analysis of Brownian Motion for Physical Measurements (Q5270593) (← links)
• Query Complexity of Sampling and Small Geometric Partitions (Q5364254) (← links)
• Centerpoints: A Link between Optimization and Convex Geometry (Q5737732) (← links)
• A simple polynomial-time rescaling algorithm for solving linear programs (Q5900037) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Comments on: Recent progress on the combinatorial diameter of polytopes and simplicial complexes (Q5965568) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• An exponential lower bound for Zadeh's pivot rule (Q6038661) (← links)
• On the generation of metric TSP instances with a large integrality gap by branch-and-cut (Q6175708) (← links)
• A copositive framework for analysis of hybrid Ising-classical algorithms (Q6495776) (← links)
• Minimizing convex functions with rational minimizers (Q6567265) (← links)
• A practical algorithm for volume estimation based on billiard trajectories and simulated annealing (Q6579766) (← links)