Term-sparse polynomial optimization for the design of frame structures
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916663455121408 |
|---|---|
| author | Handa, Marouan Tyburec, Marek Kočvara, Michal |
| author_facet | Handa, Marouan Tyburec, Marek Kočvara, Michal |
| contents | This work investigates an efficient solution to two fundamental problems in topology optimization of frame structures. The first one involves minimizing structural compliance under linear-elastic equilibrium and weight constraint, while the second one minimizes the weight under compliance constraints. These problems are non-convex and generally challenging to solve globally, with the non-convexity concentrated in a polynomial matrix inequality. We solve these problems using the moment-sum-of-squares (mSOS) hierarchy and improve the scalability by enhancing (mSOS) with the Term Sparsity Pattern (TSP) technique. Additionally, we exploit the unique polynomial structure of our problems by adopting a reduced monomial basis containing only non-mixed terms. These modifications significantly enhance computational efficiency. Extensive numerical experiments demonstrate that our approach achieves global solutions for instances twice as large as those previously solved while substantially accelerating the solution process. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2503_20915 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Term-sparse polynomial optimization for the design of frame structures Handa, Marouan Tyburec, Marek Kočvara, Michal Optimization and Control This work investigates an efficient solution to two fundamental problems in topology optimization of frame structures. The first one involves minimizing structural compliance under linear-elastic equilibrium and weight constraint, while the second one minimizes the weight under compliance constraints. These problems are non-convex and generally challenging to solve globally, with the non-convexity concentrated in a polynomial matrix inequality. We solve these problems using the moment-sum-of-squares (mSOS) hierarchy and improve the scalability by enhancing (mSOS) with the Term Sparsity Pattern (TSP) technique. Additionally, we exploit the unique polynomial structure of our problems by adopting a reduced monomial basis containing only non-mixed terms. These modifications significantly enhance computational efficiency. Extensive numerical experiments demonstrate that our approach achieves global solutions for instances twice as large as those previously solved while substantially accelerating the solution process. |
| title | Term-sparse polynomial optimization for the design of frame structures |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2503.20915 |