{"title":"半定规划的三维莫尔库仑极限分析","authors":"K. Krabbenhøft, A. Lyamin, S. Sloan","doi":"10.1002/CNM.1018","DOIUrl":null,"url":null,"abstract":"Recently, Krabbenhoft et al. (Int. J. Solids Struct. 2007; 44:1533–1549) have presented a formulation of the three-dimensional Mohr–Coulomb criterion in terms of positive-definite cones. The capabilities of this formulation when applied to large-scale three-dimensional problems of limit analysis are investigated. Following a brief discussion on a number of theoretical and algorithmic issues, three common, but traditionally difficult, geomechanics problems are solved and the performance of a common primal–dual interior-point algorithm (SeDuMi (Appl. Numer. Math. 1999; 29:301–315)) is documented in detail. Although generally encouraging, the results also reveal several difficulties which support the idea of constructing a conic programming algorithm specifically dedicated to plasticity problems. Copyright © 2007 John Wiley & Sons, Ltd.","PeriodicalId":51245,"journal":{"name":"Communications in Numerical Methods in Engineering","volume":"24 1","pages":"1107-1119"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/CNM.1018","citationCount":"127","resultStr":"{\"title\":\"Three-dimensional Mohr-Coulomb limit analysis using semidefinite programming\",\"authors\":\"K. Krabbenhøft, A. Lyamin, S. Sloan\",\"doi\":\"10.1002/CNM.1018\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Krabbenhoft et al. (Int. J. Solids Struct. 2007; 44:1533–1549) have presented a formulation of the three-dimensional Mohr–Coulomb criterion in terms of positive-definite cones. The capabilities of this formulation when applied to large-scale three-dimensional problems of limit analysis are investigated. Following a brief discussion on a number of theoretical and algorithmic issues, three common, but traditionally difficult, geomechanics problems are solved and the performance of a common primal–dual interior-point algorithm (SeDuMi (Appl. Numer. Math. 1999; 29:301–315)) is documented in detail. Although generally encouraging, the results also reveal several difficulties which support the idea of constructing a conic programming algorithm specifically dedicated to plasticity problems. Copyright © 2007 John Wiley & Sons, Ltd.\",\"PeriodicalId\":51245,\"journal\":{\"name\":\"Communications in Numerical Methods in Engineering\",\"volume\":\"24 1\",\"pages\":\"1107-1119\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1002/CNM.1018\",\"citationCount\":\"127\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Communications in Numerical Methods in Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/CNM.1018\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Communications in Numerical Methods in Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/CNM.1018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 127