Constrained efficient global optimization with support vector machines

Authors:
Anirban Basudhar;Christoph Dribusch;Sylvain Lacaze;Samy Missoum
Affiliations:
Aerospace and Mechanical Engineering Department, The University of Arizona, Tucson, USA 85721;Aerospace and Mechanical Engineering Department, The University of Arizona, Tucson, USA 85721;Aerospace and Mechanical Engineering Department, The University of Arizona, Tucson, USA 85721;Aerospace and Mechanical Engineering Department, The University of Arizona, Tucson, USA 85721
Venue:
Structural and Multidisciplinary Optimization
Year:
2012

Citing 7
Cited 2

An introduction to support Vector Machines: and other kernel-based learning methods

An introduction to support Vector Machines: and other kernel-based learning methods
Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond

Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
Efficient Global Optimization of Expensive Black-Box Functions

Journal of Global Optimization
Computer experiments and global optimization

Computer experiments and global optimization
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)

Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
A note on Platt's probabilistic outputs for support vector machines

Machine Learning
Adaptive explicit decision functions for probabilistic design and optimization using support vector machines

Computers and Structures

Adaptive virtual support vector machine for reliability analysis of high-dimensional problems

Structural and Multidisciplinary Optimization
Selection of initial designs for multi-objective optimization using classification and regression tree

Structural and Multidisciplinary Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a methodology for constrained efficient global optimization (EGO) using support vector machines (SVMs). While the objective function is approximated using Kriging, as in the original EGO formulation, the boundary of the feasible domain is approximated explicitly as a function of the design variables using an SVM. Because SVM is a classification approach and does not involve response approximations, this approach alleviates issues due to discontinuous or binary responses. More importantly, several constraints, even correlated, can be represented using one unique SVM, thus considerably simplifying constrained problems. In order to account for constraints, this paper introduces an SVM-based "probability of feasibility" using a new Probabilistic SVM model. The proposed optimization scheme is constituted of two levels. In a first stage, a global search for the optimal solution is performed based on the "expected improvement" of the objective function and the probability of feasibility. In a second stage, the SVM boundary is locally refined using an adaptive sampling scheme. An unconstrained and a constrained formulation of the optimization problem are presented and compared. Several analytical examples are used to test the formulations. In particular, a problem with 99 constraints and an aeroelasticity problem with binary output are presented. Overall, the results indicate that the constrained formulation is more robust and efficient.