Complexity analysis of a sampling-based interior point method for convex optimization
Year of publication: |
2022
|
---|---|
Authors: | Badenbroek, Riley ; Klerk, Etienne de |
Published in: |
Mathematics of operations research. - Hanover, Md. : INFORMS, ISSN 1526-5471, ZDB-ID 2004273-5. - Vol. 47.2022, 1, p. 779-811
|
Subject: | convex optimization | entropic barrier | hit-and-run sampling | interior point method | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Innere-Punkte-Verfahren mit Redundanzerkennung für die quadratische Optimierung
Schade, Philipp, (2008)
-
Linear Programming : Foundations and Extensions
Vanderbei, Robert J., (2020)
-
A new efficient short-step projective interior point method for linear programming
Bouafia, Mousaab, (2018)
- More ...
-
An analytic center cutting plane method to determine complete positivity of a matrix
Badenbroek, Riley, (2022)
-
Interior point methods and simulated annealing for nonsymmetric conic optimization
Badenbroek, Riley, (2021)
-
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
Klerk, Etienne de, (2008)
- More ...