This is the authors' abstract. We don't add key points for this paper.
A new method for non‐linear programming in general and structural optimization in particular is presented. In each step of the iterative process, a strictly convex approximating subproblem is generated and solved. The generation of these subproblems is controlled by so called ‘moving asymptotes’, which may both stabilize and speed up the convergence of the general process.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Krister Svanberg (1987) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: