scientific article; zbMATH DE number 7179961
From MaRDI portal
Publication:5219717
zbMath1441.90116MaRDI QIDQ5219717
Publication date: 12 March 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Linear programming (90C05) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives, Geodesic Walks in Polytopes, Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization, What Tropical Geometry Tells Us about the Complexity of Linear Programming, Projectively Self-Concordant Barriers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Centroid bodies and the logarithmic Laplace transform - A unified approach
- Exponentiated gradient versus gradient descent for linear predictors
- A new polynomial-time algorithm for linear programming
- On convex perturbations with a bounded isotropic constant
- Convex set functions in d-space
- Introductory lectures on convex optimization. A basic course.
- The extreme points of subsets of s-concave probabilities and a geometric localization theorem
- A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone
- On the Blaschke-Santaló inequality
- Random Walks on Polytopes and an Affine Interior Point Method for Linear Programming
- Approximately gaussian marginals and the hyperplane conjecture
- The geometry of logconcave functions and sampling algorithms
- Graphical Models, Exponential Families, and Variational Inference
- Barrier Functions in Interior Point Methods
- On the Self-Concordance of the Universal Barrier Function
- Universal Portfolios
- Entropy jumps for isotropic log-concave random vectors and spectral gap
- Canonical Barriers on Convex Cones
- Logarithmically-Concave Moment Measures I
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Prediction, Learning, and Games
- Location of the Maximum on Unimodal Surfaces
- Solving convex programs by random walks
