A New Extreme Point Algorithm and Its Application in PSQP Algorithms for Solving Mathematical Programs with Linear Complementarity Constraints.
Jianzhong ZhangGuoshan LiuPublished in: J. Glob. Optim. (2001)
Keyphrases
- learning algorithm
- times faster
- computational complexity
- computational efficiency
- combinatorial optimization
- theoretical analysis
- single pass
- computational cost
- worst case
- classification algorithm
- memory requirements
- convergence rate
- decomposition algorithm
- quadratic optimization problems
- benchmark problems
- space complexity
- constraint solver
- linear programming
- computationally efficient
- dynamic programming
- objective function
- provably correct
- hybrid algorithms
- significant improvement
- solution quality
- quadratic programming
- iterative algorithms
- non binary
- optimal solution
- convex quadratic programming
- simulated annealing
- np hard
- partial solutions
- path consistency
- constrained problems
- synthetic datasets
- constraint graph
- backtracking algorithm
- algebraic equations