Papers › Global weight optimization of frame structures under free-vibration eigenvalue constraints
Global weight optimization of frame structures under free-vibration eigenvalue constraints
Marek Tyburec, Michal Kočvara, Marouan Handa, Jan Zeman
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with disconnected feasible sets. In this article, we first formulate it as a polynomial semidefinite programming problem (SDP) of minimizing a linear function over a basic semi-algebraic feasible set. We then propose to solve this problem by Lasserre hierarchy of linear semidefinite relaxations providing a sequence of increasing lower bounds. To obtain also a sequence of upper bounds and thus conditions on global ε-optimality, we provide a bilevel reformulation that exhibits a special structure: The lower level is quasiconvex univariate and it has a non-empty interior if the constraints of the upper-level problem are satisfied. After deriving the conditions for the solvability of the lower-level problem, we thus provide a way to construct feasible points to the original SDP. Using such a feasible point, we modify the original nonlinear SDP to satisfy the conditions for the deployment of the Lasserre hierarchy. Solving arbitrary degree relaxation of the hierarchy, we prove that scaled first-order moments associated with the problem variables satisfy feasibility conditions for the lower-level problem and thus provide guaranteed upper and lower bounds on the objective function. Using these bounds, we develop a simple sufficient condition for global ε-optimality and prove that the optimality gap ε converges to zero if the set of global minimizers is convex. Finally, we illustrate these results with four representative problems for which the hierarchy converges in at most five relaxation degrees
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections