Two wide neighborhood interior-point methods for symmetric cone optimization.
M. Sayadi ShahrakiHossein MansouriMaryam ZangiabadiPublished in: Comput. Optim. Appl. (2017)
Keyphrases
- interior point methods
- semidefinite
- convex programming
- quadratic programming
- convex optimization
- linear program
- semidefinite programming
- primal dual
- linear programming
- semi infinite
- interior point
- linear programming problems
- norm minimization
- pairwise
- image processing
- cutting plane method
- quadratically constrained quadratic
- linear systems
- solving problems
- computationally intensive
- sufficient conditions
- training data
- machine learning