Solving quadratically constrained convex optimization problems with an interior-point method.

Csaba Mészáros

Published in: Optim. Methods Softw. (2011)

Keyphrases

interior point methods
convex optimization problems
convex optimization
primal dual
linear programming
quadratic programming
linear program
semidefinite programming
solving problems
computationally intensive
total variation
low rank
constrained problems