Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
From MaRDI portal
Publication:953214
DOI10.1007/s10589-007-9138-5zbMath1181.90202OpenAlexW2091339908WikidataQ56050738 ScholiaQ56050738MaRDI QIDQ953214
Mathias Stolpe, Wolfgang Achtziger
Publication date: 17 November 2008
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9138-5
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimization of other properties in solid mechanics (74P10)
Related Items (15)
Bridging mixed integer linear programming for truss topology optimization and additive manufacturing ⋮ Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results ⋮ Discrete multi-load truss sizing optimization: model analysis and computational experiments ⋮ Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples ⋮ Global optimization of robust truss topology via mixed integer semidefinite programming ⋮ On some fundamental properties of structural topology optimization problems ⋮ Global optima for the Zhou-Rozvany problem ⋮ A fast method for binary programming using first-order derivatives, with application to topology optimization with buckling constraints ⋮ A new branch and bound method for a discrete truss topology design problem ⋮ Topology optimization of adaptive structures: new limits of material economy ⋮ Generalized Benders' decomposition for topology optimization problems ⋮ Truss topology optimization with discrete design variables by outer approximation ⋮ Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems ⋮ Global optimization of trusses with constraints on number of different cross-sections: a mixed-integer second-order cone programming approach ⋮ Towards a lifecycle oriented design of infrastructure by mathematical optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Truss topology optimization with discrete design variables -- guaranteed global optimality and benchmark examples
- Genetic algorithms in truss topological optimization
- Global optimization of truss topology with discrete bar areas. II: Implementation and numerical results
- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- Multiple-load truss topology and sizing optimization: Some properties of minimax compliance
- On extensions of the Frank-Wolfe theorems
- An iterative working-set method for large-scale nonconvex quadratic programming
- Hidden convexity in some nonconvex quadratically constrained quadratic programming
- Lectures on Modern Convex Optimization
- Inertia-Controlling Methods for General Quadratic Programming
- Equivalent displacement based formulations for maximum strength truss topology design
- Numerically stable methods for quadratic programming
- Optimal Truss Design by Interior-Point Methods
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Robust Truss Topology Design via Semidefinite Programming
- Modified trajectory method for practical global optimization problems
- A New Method for Optimal Truss Topology Design
- Convex Analysis
- Technical Note—Direct Proof of the Existence Theorem for Quadratic Programming
This page was built for publication: Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
