Truss topology optimization with discrete design variables by outer approximation
From MaRDI portal
Publication:486729
DOI10.1007/s10898-014-0142-xzbMath1312.90037OpenAlexW2000541022WikidataQ56050692 ScholiaQ56050692MaRDI QIDQ486729
Publication date: 16 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-014-0142-x
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Mixed-integer second-order cone optimization for composite discrete ply-angle and thickness topology optimization 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
- On the validity of using small positive lower bounds on design variables in discrete topology optimization
- On some fundamental properties of structural topology optimization problems
- Generalized Benders' decomposition for topology optimization problems
- 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
- On the reformulation of topology optimization problems as linear or convex quadratic mixed 0-1 programs
- Applications of second-order cone programming
- Solving mixed integer nonlinear programs by outer approximation
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs
- Discrete material optimization of general composite shell structures
- Structural Topology Optimization with Eigenvalues
- Optimal Design of Truss Structures by Logic-Based Branch and Cut
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Robust Truss Topology Design via Semidefinite Programming
- Modelling topology optimization problems as linear mixed 0-1 programs
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Semidefinite Programming
