Abstract
Constraints can render a numerical optimization problem much more difficult to address. In many real-world optimization applications, however, such constraints are not explicitly given. Instead, one has access to some kind of a "black-box" that represents the (unknown) constraint function. Recently, we proposed a fast linear constraint estimator that was based on binary search. This paper extends these results by (a) providing an alternative scheme that resorts to the effective use of support vector machines and by (b) addressing the more general task of non-linear decision boundaries. In particular, we make use of active learning strategies from the field of machine learning to select reasonable training points for the recurrent application of the classifier. We compare both constraint estimation schemes on linear and non-linear constraint functions, and depict opportunities and pitfalls concerning the effective integration of such models into a global optimization process.
Original language | English |
---|---|
Title of host publication | Applications of Evolutionary Computation : 16th European Conference, EvoApplications 2013, Vienna, Austria, April 3-5, 2013. Proceedings |
Editors | Anna I. Esparcia-Alcázar |
Number of pages | 10 |
Publisher | Springer |
Publication date | 2013 |
Pages | 459-468 |
ISBN (Print) | 978-3-642-37191-2 |
ISBN (Electronic) | 978-3-642-37192-9 |
DOIs | |
Publication status | Published - 2013 |
Externally published | Yes |
Event | 16th European Conference on Applications of Evolutionary Computation - Wien, Austria Duration: 3 Apr 2013 → 5 Apr 2013 Conference number: 16 |
Conference
Conference | 16th European Conference on Applications of Evolutionary Computation |
---|---|
Number | 16 |
Country/Territory | Austria |
City | Wien |
Period | 03/04/2013 → 05/04/2013 |
Series | Lecture notes in computer science |
---|---|
Volume | 7835 |
ISSN | 0302-9743 |