On the complexity analysis of a Mehrotra-type primal-dual feasible algorithm for semidefinite optimization.
Mohammad H. KoulaeiTamás TerlakyPublished in: Optim. Methods Softw. (2010)
Keyphrases
- complexity analysis
- optimization algorithm
- objective function
- linear programming
- theoretical analysis
- optimal solution
- optimization problems
- dynamic programming
- semidefinite
- computational complexity
- semi supervised
- linear program
- convex hull
- computationally intensive
- primal dual
- semidefinite programming
- linear combination
- multistage
- optimization method
- convergence rate
- convex relaxation
- learning algorithm