Skip to main content
Log in

A sequential parametric convex approximation method with applications to nonconvex truss topology design problems

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

We describe a general scheme for solving nonconvex optimization problems, where in each iteration the nonconvex feasible set is approximated by an inner convex approximation. The latter is defined using an upper bound on the nonconvex constraint functions. Under appropriate conditions, a monotone convergence to a KKT point is established. The scheme is applied to truss topology design (TTD) problems, where the nonconvex constraints are associated with bounds on displacements and stresses. It is shown that the approximate convex problem solved at each inner iteration can be cast as a conic quadratic programming problem, hence large scale TTD problems can be efficiently solved by the proposed method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Adjiman C.S., Androulakis I.P., Floudas C.A.: A global optimization method, αBB, for general twice-differentiable NLPs implementation and computational results. Comput. Chem. Eng. 22, 1159–1178 (1998)

    Article  Google Scholar 

  2. Adjiman C.S., Dallwig S., Floudas C.A., Neumaier A.: A global optimization method, αBB, for general twice-differentiable NLPs theoretical advances. Comput. Chem. Eng. 22, 1137–1158 (1998)

    Article  Google Scholar 

  3. Ben-Tal A., Jarre F., Kocvara M., Nemirovski A., Zowe J.: Optimal design of trusses under a nonconvex global buckling constraint. Optim. Eng. 1, 189–213 (2000)

    Article  Google Scholar 

  4. Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. MPS-SIAM Series on Optimization (2001)

  5. Bertsekas D.P.: Nonlinear Programming. 2nd edn. Athena Scientific, Belmont, MA (1999)

    Google Scholar 

  6. Braggi M.: On an alternative approach to stress constraints relaxation in topology optimization. Struct. Multidiscipl. Optim. 36, 125–141 (2008)

    Article  Google Scholar 

  7. Cheng G., Guo X.: Epsilon-relaxed approach to structural topology optimization. Struct. Optim. 13, 258–266 (1997)

    Article  Google Scholar 

  8. Kocvara M.: Topology optimization with displacement constraints: a bilevel programming approach. Struct. Multidiscipl. optim. 14(4), 256–263 (1997)

    Google Scholar 

  9. McCormick, G.P.: Nonlinear programming. John Wiley & Sons Inc., New York, (1983). Theory, algorithms, and applications, A Wiley-Interscience Publication

  10. Stolpe M.: Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch-and-bound. Int. J. Numer. Methods Eng. 61, 1270–1309 (2004)

    Article  Google Scholar 

  11. Stolpe M., Svanberg K.: On the trajectories of the epsilon-relaxation approach for stress-constrained truss topology optimization. Struct. Multidiscipl. Optim. 21, 140–151 (2001)

    Article  Google Scholar 

  12. Stolpe M., Svanberg K.: A note on stress-constrained truss topology optimization. Struct. Multidiscipl. Optim. 25, 62–64 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Amir Beck.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Beck, A., Ben-Tal, A. & Tetruashvili, L. A sequential parametric convex approximation method with applications to nonconvex truss topology design problems. J Glob Optim 47, 29–51 (2010). https://doi.org/10.1007/s10898-009-9456-5

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-009-9456-5

Keywords

Navigation