No abstract

SUMMARYThis paper exposes an interior-point method used to solve convex programming problems raised by limit analysis in mechanics. First we explain the main features of this method, describing in particular its typical iteration. Secondly, we show and study the results of its application to a concrete limit analysis problem, for a large range of sizes, and we compare them for validation with existing results and with those of linearized versions of the problem. As one of the objectives of the work, another classical problem is analysed for a Gurson material, to which linearization or conic programming does not apply.

No abstract