An infeasible active-set QP-free algorithm for general nonlinear programming.
Hua WangFuyao LiuChao GuDingguo PuPublished in: Int. J. Comput. Math. (2017)
Keyphrases
- active set
- linear programming
- search space
- decomposition algorithm
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- np hard
- objective function
- nonlinear programming
- k means
- worst case
- efficient implementation
- simulated annealing
- expectation maximization
- higher dimensional
- quadratic programming
- special case
- feature space