An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood.
Behrouz KheirfamNaser OsmanpourMohammad KeyanpourPublished in: Numer. Algorithms (2021)
Keyphrases
- semidefinite
- interior point methods
- semidefinite programming
- convex optimization
- convex relaxation
- quadratic programming
- primal dual
- linear program
- linear programming
- solving problems
- higher dimensional
- computationally intensive
- sufficient conditions
- convex sets
- training data
- linear systems
- finite number
- high dimensional
- optimal solution