A Superlinearly Convergent Implicit Smooth SQP Algorithm for Mathematical Programs with Nonlinear Complementarity Constraints.
Jin-bao JianPublished in: Comput. Optim. Appl. (2005)
Keyphrases
- learning algorithm
- detection algorithm
- high accuracy
- computational cost
- objective function
- computational complexity
- expectation maximization
- worst case
- times faster
- optimization algorithm
- probabilistic model
- dynamic programming
- search space
- experimental evaluation
- sequential quadratic programming
- multiple constraints
- provably correct
- constrained optimization
- convergence rate
- optimal solution
- preprocessing
- theoretical analysis
- k means
- genetic algorithm
- cost function
- matching algorithm
- decision trees
- recognition algorithm
- space complexity
- path consistency
- significant improvement