Efficiently handling constraints with Metropolis-adjusted Langevin algorithm.
Jinyuan ChangCheng Yong TangYuanzheng ZhuPublished in: CoRR (2023)
Keyphrases
- improved algorithm
- optimization algorithm
- simulated annealing
- dynamic programming
- k means
- multiple constraints
- cost function
- preprocessing
- search space
- computationally efficient
- data sets
- high accuracy
- significant improvement
- computational cost
- learning algorithm
- space complexity
- constrained optimization
- genetic algorithm
- times faster
- matching algorithm
- detection algorithm
- theoretical analysis
- objective function
- np hard
- classification algorithm
- expectation maximization
- particle swarm optimization
- linear programming
- highly efficient
- similarity measure
- worst case