1987/02/01 by Krister Svanberg · 5,487 citations
Engineering · Mathematics · #Advanced Optimization Algorithms Research #Applied mathematics #Asymptote #Computer science #Convergence (economics) #Convex optimization #Geometry #Iterative Methods for Nonlinear Equations #Iterative and incremental development #Iterative method #Mathematical analysis #Mathematical optimization #Mathematics #Process (computing) #Regular polygon #Topology Optimization in Engineering
paper · doi:10.1002/nme.1620240207
published in International Journal for Numerical Methods in Engineering 24(2), 359-373 (Wiley)
openalex publication_date 1987/02/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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 asymptotes’, which may both stabilize and speed up the convergence of the general process.