Abstract 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 asympt...
No comments yet
Be the first to share your thoughts!