Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization.
Hayato WakiMaho NakataMasakazu MuramatsuPublished in: Comput. Optim. Appl. (2012)
Keyphrases
- semidefinite programming
- interior point methods
- convex programming
- nonlinear programming
- semidefinite
- quadratic programming
- linear programming
- linear programming problems
- solving problems
- interior point
- quadratically constrained quadratic
- primal dual
- convex optimization
- quadratic program
- linear program
- kernel matrix
- maximum margin
- semi infinite
- semi definite programming
- computationally intensive
- kernel function
- np hard
- high dimensional