Login / Signup
Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones.
Martin S. Andersen
Joachim Dahl
Lieven Vandenberghe
Published in:
Math. Program. Comput. (2010)
Keyphrases
</>
interior point methods
sparse matrix
quadratic programming
semidefinite
convex optimization
linear programming
linear systems
primal dual
linear program
semidefinite programming
optimization problems
data sets
feature space
special case
dynamical systems