Non-convex multiobjective optimization under uncertainty: a descent algorithm. Application to sandwich plate design and reliability

In this paper a novel algorithm for solving multiobjective design optimization problems with non-smooth objective functions and uncertain parameters is presented. The algorithm is based on the existence of a common descent vector for each sample of the random objective functions and on an extension...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Engineering optimization Ročník 51; číslo 5; s. 733 - 752
Hlavní autoři: Mercier, Q., Poirion, F., Désidéri, J. A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Taylor & Francis 04.05.2019
Taylor & Francis Ltd
Témata:
Algorithms
Computer Science
Data Structures and Algorithms
Descent
Design optimization
Engineering Sciences
Genetic algorithms
Materials
Multiobjective optimization
Multiple objective analysis
Parallel processing
Parameter uncertainty
Reliability
stochastic algorithm
uncertainty
INCERTITUDE
ALGORITHME STOCHASTIQUE
FIABILITE
OPTIMISATION MULTIDISCIPLINAIRE
ISSN:0305-215X, 1029-0273
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this paper a novel algorithm for solving multiobjective design optimization problems with non-smooth objective functions and uncertain parameters is presented. The algorithm is based on the existence of a common descent vector for each sample of the random objective functions and on an extension of the stochastic gradient algorithm. The proposed algorithm is applied to the optimal design of sandwich material. Comparisons with the genetic algorithm NSGA-II and the DMS solver are given and show that it is numerically more efficient due to the fact that it does not necessitate the objective function expectation evaluation. It can moreover be entirely parallelizable. Another simple illustration highlights its potential for solving general reliability problems, replacing each probability constraint by a new objective written in terms of an expectation. Moreover, for this last application, the proposed algorithm does not necessitate the computation of the (small) probability of failure.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0305-215X
1029-0273
DOI:10.1080/0305215X.2018.1486401