Simulated Annealing for Convex Optimization
From MaRDI portal
Publication:5387978
DOI10.1287/moor.1060.0194zbMath1278.90311OpenAlexW2168908795MaRDI QIDQ5387978
Adam Tauman Kalai, Santosh Vempala
Publication date: 27 May 2008
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/06e0860bf84c9392fd1950338f73fbb13a2b5e3f
Convex programming (90C25) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (26)
On the Complexity of Random Satisfiability Problems with Planted Solutions ⋮ Efficient sampling in spectrahedra and volume approximation ⋮ Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere ⋮ Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives ⋮ Operations research methods for estimating the population size of neuron types ⋮ Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization ⋮ Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization ⋮ Computational results of an \(O^{\ast }(n^{4})\) volume algorithm ⋮ Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation ⋮ Pattern hit-and-run for sampling efficiently on polytopes ⋮ Pattern discrete and mixed hit-and-run for global optimization ⋮ On structured output training: hard cases and an efficient alternative ⋮ Efficient Convex Optimization with Oracles ⋮ A Survey of Semidefinite Programming Approaches to the Generalized Problem of Moments and Their Error Analysis ⋮ Adaptive search with stochastic acceptance probabilities for global optimization ⋮ On multivariate quantiles under partial orders ⋮ On EM algorithms and their proximal generalizations ⋮ A Hit‐and‐Run approach for generating scale invariant Small World networks ⋮ Research on probabilistic methods for control system design ⋮ A dynamic programming approach to efficient sampling from Boltzmann distributions ⋮ On randomized fictitious play for approximating saddle points over convex sets ⋮ Projective re-normalization for improving the behavior of a homogeneous conic linear system ⋮ Comparison of Lasserre’s Measure-Based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing ⋮ Evolvability of Real Functions ⋮ Deterministic Construction of an Approximate M-Ellipsoid and its Application to Derandomizing Lattice Algorithms ⋮ Unnamed Item
This page was built for publication: Simulated Annealing for Convex Optimization
