A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
From MaRDI portal
Publication:969739
DOI10.1007/s10898-009-9456-5zbMath1220.90095OpenAlexW2100573451MaRDI QIDQ969739
Luba Tetruashvili, Aharon Ben-Tal, Amir Beck
Publication date: 7 May 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9456-5
nonconvex optimizationtruss topology designKKT pointsdisplacement and stress constraintssuccessive convex approximations
Related Items (9)
Variations and extension of the convex-concave procedure ⋮ Robust truss topology optimization via semidefinite programming with complementarity constraints: a difference-of-convex programming approach ⋮ Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ Efficient formulations of the material identification problem using full-field measurements ⋮ Application of the sequential parametric convex approximation method to the design of robust trusses ⋮ Some symmetry results for optimal solutions in structural optimization ⋮ A less conservative robust control method for a class of nonpassive uncertain systems ⋮ Sequential parametric convex approximation algorithm for bilinear matrix inequality problem ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
Cites Work
- Unnamed Item
- Unnamed Item
- On an alternative approach to stress constraints relaxation in topology optimization
- Lectures on Modern Convex Optimization
- Modelling topology optimization problems as linear mixed 0-1 programs
- Global optimization of minimum weight truss topology problems with stress, displacement, and local buckling constraints using branch‐and‐bound
- Optimal design of trusses under a nonconvex global buckling constraint
This page was built for publication: A sequential parametric convex approximation method with applications to nonconvex truss topology design problems
