On the Turing model complexity of interior point methods for semidefinite programming.

Etienne de Klerk Frank Vallentin

Published in: CoRR (2015)

Keyphrases

semidefinite programming
interior point methods
linear programming
probabilistic model
objective function
input data
primal dual