Optimization methods

 

 

Date

05/11/2007

Author

F. Moussouni, S. Brisset , P. Brochet

Affiliation

L2EP EC Lille France

Email

fouzia.moussouni@ec-lille.fr, stephane.brisset@ec-lille.fr

Method

Variable weighted sum of objectives with SQP

References

[1] F. Moussouni, S. Brisset, P. Brochet, “Some results on design of brushless DC wheel motor using SQP and GA”, International Journal of Applied Electromagnetics and Mechanics I.J.A.E.M. Issue: vol. 26, Num 3-4/2007, P. 233-241

Description of the method

The mono-objective optimization method SQP can solve multi-objective optimization problem using variable weighted sum of objectives.

Then, the Pareto front can be obtained using several values of the weight α taken from [0,1].

Therefore, if the initial point is far from the global solution, the SQP algorithm can be trapped in local optima. To overcome this disadvantage, SQP should be restarted with several initial points in order to compute each Pareto front point.

 

  

Back