A general non-linear optimization algorithm for lower bound limit analysis

Kristian Krabbenhøft, Lars Damkilde

Research output: Contribution to journalJournal articleResearchpeer-review


The non-linear programming problem associated with the discrete lower bound limit analysis problem is treated by means of an algorithm where the need to linearize the yield criteria is avoided. The algorithm is an interior point method and is completely general in the sense that no particular finite element discretization or yield criterion is required. As with interior point methods for linear programming the number of iterations is affected only little by the problem size. Some practical implementation issues are discussed with reference to the special structure of the common lower bound load optimization problem. and finally the efficiency and accuracy of the method is demonstrated by means of examples of plate and slab structures obeying different non-linear yield criteria. Copyright (C) 2002 John Wiley Sons. Ltd.
Original languageEnglish
JournalInternational Journal for Numerical Methods in Engineering
Issue number2
Pages (from-to)165-184
Publication statusPublished - 2003

Fingerprint Dive into the research topics of 'A general non-linear optimization algorithm for lower bound limit analysis'. Together they form a unique fingerprint.

Cite this