An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints.
Ye LuYa-Xiang YuanPublished in: Optim. Methods Softw. (2008)
Keyphrases
- convex constraints
- dynamic programming
- convex optimization
- linear programming
- expectation maximization
- objective function
- np hard
- special case
- simulated annealing
- search space
- learning algorithm
- computational complexity
- primal dual
- semidefinite programming
- convex hull
- interior point
- em algorithm
- global optimum
- nonnegative matrix factorization