A greedy algorithm for yield surface approximation

Jérémy Bleyer; Patrick de Buhan

doi:10.1016/j.crme.2013.06.003

A greedy algorithm for yield surface approximation

Jérémy Bleyer
, Patrick de Buhan

Université Paris-Est

Résultats de recherche: Contribution à un journal › Article › Revue par des pairs

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.

langue originale	Anglais
Pages (de - à)	605-615
Nombre de pages	11
journal	Comptes Rendus - Mecanique
Volume	341
Numéro de publication	8
Les DOIs	https://doi.org/10.1016/j.crme.2013.06.003
état	Publié - 1 août 2013
Modification externe	Oui

Accès au document

10.1016/j.crme.2013.06.003

Contient cette citation

@article{c27562ce1cc54a609c9ef500a36b17ee,

title = "A greedy algorithm for yield surface approximation",

abstract = "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.",

keywords = "Limit analysis, Second-order cone programming, Solids and structures, Yield design, Yield surface approximation",

author = "J{\'e}r{\'e}my Bleyer and \{de Buhan\}, Patrick",

year = "2013",

month = aug,

day = "1",

doi = "10.1016/j.crme.2013.06.003",

language = "English",

volume = "341",

pages = "605--615",

journal = "Comptes Rendus - Mecanique",

issn = "1631-0721",

number = "8",

}

TY - JOUR

T1 - A greedy algorithm for yield surface approximation

AU - Bleyer, Jérémy

AU - de Buhan, Patrick

PY - 2013/8/1

Y1 - 2013/8/1

N2 - 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.

AB - 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.

KW - Limit analysis

KW - Second-order cone programming

KW - Solids and structures

KW - Yield design

KW - Yield surface approximation

U2 - 10.1016/j.crme.2013.06.003

DO - 10.1016/j.crme.2013.06.003

M3 - Article

AN - SCOPUS:84881544921

SN - 1631-0721

VL - 341

SP - 605

EP - 615

JO - Comptes Rendus - Mecanique

JF - Comptes Rendus - Mecanique

IS - 8

ER -

A greedy algorithm for yield surface approximation

Résumé

Accès au document

Empreinte digitale

Contient cette citation