A full NT-step infeasible interior-point algorithm for semidefinite optimization.
Mohammad PirhajiHossein MansouriMaryam ZangiabadiPublished in: RAIRO Oper. Res. (2017)
Keyphrases
- semidefinite
- interior point methods
- interior point algorithm
- semidefinite programming
- linear programming
- primal dual
- convex optimization
- quadratic programming
- convex relaxation
- linear program
- sufficient conditions
- higher dimensional
- solving problems
- convex sets
- optimization problems
- feature selection
- computationally intensive
- convergence rate
- np hard
- optimal solution
- simplex method
- reinforcement learning