Reduction of truss topology optimization
From MaRDI portal
Recommendations
- Exploiting group symmetry in truss topology optimization
- Optimization of truss vibration with reduction of symmetric semidefinite programming
- Robust Truss Topology Design via Semidefinite Programming
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Effective reformulations of the truss topology design problem
Cites work
- A class of polynomial primal-dual interior-point algorithms for semidefinite optimization
- A comparison of the Delsarte and Lovász bounds
- A new primal-dual interior-point algorithm for convex quadratic optimization
- Exploiting group symmetry in truss topology optimization
- Group symmetry in interior-point methods for semidefinite program
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
- Reduction of symmetric semidefinite programs using the regular -representation
- Symmetry groups, semidefinite programs, and sums of squares
Cited in
(5)- Exploiting group symmetry in truss topology optimization
- Redundant robust topology optimization of truss
- Optimization of truss vibration with reduction of symmetric semidefinite programming
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Reduction of bridge positions along bridge disks
This page was built for publication: Reduction of truss topology optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3052591)
