A greedy algorithm for yield surface approximation
Résumé
This Note presents an approximation method for convex yield surfaces in the framework of yield design theory. The proposed algorithm constructs an approximation using a convex hull of ellipsoids such that the approximate criterion can be formulated in terms of second-order conic constraints. The algorithm can treat bounded as well as unbounded yield surfaces. Its efficiency is illustrated on two yield surfaces obtained using up-scaling procedures.
Format : Figure, Image
Origine : Fichiers produits par l'(les) auteur(s)
Format : Figure, Image
Format : Figure, Image
Format : Figure, Image
Loading...