Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
From MaRDI portal
Publication:5076724
DOI10.1287/moor.2021.1150zbMath1492.90120arXiv1811.07677OpenAlexW3127397249MaRDI QIDQ5076724
Riley Badenbroek, Etienne de Klerk
Publication date: 17 May 2022
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.07677
Related Items
Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- On convex perturbations with a bounded isotropic constant
- Isoperimetric problems for convex bodies and a localization lemma
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Direction Choice for Accelerated Convergence in Hit-and-Run Sampling
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- The geometry of logconcave functions and sampling algorithms
- Barrier Functions in Interior Point Methods
- Random walks and anO*(n5) volume algorithm for convex bodies
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation
- Hit-and-Run Algorithms for Generating Multivariate Distributions
- Simulated Annealing for Convex Optimization
- Hit-and-Run from a Corner
