Global Continuous Optimization with Error Bound and Fast Convergence
This paper considers global optimization with a black-box unknown objective function that can be non-convex and non-differentiable. Such a difficult optimization problem arises in many real-world applications, such as parameter tuning in machine learning, engineering design problem, and planning wit...
Main Authors: | , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Association for the Advancement of Artificial Intelligence,
2017-03-28T17:19:32Z.
|
Subjects: | |
Online Access: | Get fulltext |