Pages that link to "Item:Q5387978"
From MaRDI portal
The following pages link to Simulated Annealing for Convex Optimization (Q5387978):
Displaying 26 items.
- Computational results of an \(O^{\ast }(n^{4})\) volume algorithm (Q421722) (← links)
- Pattern hit-and-run for sampling efficiently on polytopes (Q433826) (← links)
- On multivariate quantiles under partial orders (Q548551) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- On randomized fictitious play for approximating saddle points over convex sets (Q747628) (← links)
- Adaptive search with stochastic acceptance probabilities for global optimization (Q943781) (← links)
- Projective re-normalization for improving the behavior of a homogeneous conic linear system (Q1016122) (← links)
- On structured output training: hard cases and an efficient alternative (Q1959508) (← links)
- Efficient sampling in spectrahedra and volume approximation (Q2144244) (← links)
- Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere (Q2144547) (← links)
- Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives (Q2156386) (← links)
- Operations research methods for estimating the population size of neuron types (Q2158643) (← links)
- Research on probabilistic methods for control system design (Q2276096) (← links)
- A dynamic programming approach to efficient sampling from Boltzmann distributions (Q2517788) (← links)
- Evolvability of Real Functions (Q2828219) (← links)
- Efficient Convex Optimization with Oracles (Q3295271) (← links)
- A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis (Q3296188) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- (Q4637035) (← links)
- Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization (Q5076724) (← links)
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation (Q5116548) (← links)
- On EM algorithms and their proximal generalizations (Q5190287) (← 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)
- Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms (Q5743489) (← links)
