September 16, 2019
Optimization of frame structures is formulated as a~non-convex optimization problem, which is currently solved to local optimality. In this contribution, we investigate four optimization approaches: (i) general non-linear optimization, (ii) optimality criteria method, (iii) non-linear semidefinite programming, and (iv) polynomial optimization. We show that polynomial optimization solves the frame structure optimization to global optimality by building the (moment-sums-of-squares) hierarchy of convex linear semidefinite programming problems, and it also provides guaranteed lower and upper bounds on optimal design. Finally, we solve three sample optimization problems and conclude that the local optimization approaches may indeed converge to local optima, without any solution quality measure, or even to infeasible points. These issues are readily overcome by using polynomial optimization, which exhibits a finite convergence, at the prize of higher computational demands.
Similar papers 1
September 26, 2020
The design of minimum-compliance bending-resistant structures with continuous cross-section parameters is a challenging task because of its inherent non-convexity. Our contribution develops a strategy that facilitates computing all guaranteed globally optimal solutions for frame and shell structures under multiple load cases and self-weight. To this purpose, we exploit the fact that the stiffness matrix is usually a polynomial function of design variables, allowing us to buil...
November 25, 2022
Weight optimization of frame structures with continuous cross-section parametrization is a challenging non-convex problem that has traditionally been solved by local optimization techniques. Here, we exploit its inherent semi-algebraic structure and adopt the Lasserre hierarchy of relaxations to compute the global minimizers. While this hierarchy generates a natural sequence of lower bounds, we show, under mild assumptions, how to project the relaxed solutions onto the feasib...
May 14, 2024
Minimizing the weight in topology optimization of frame structures under free-vibration eigenvalue constraints constitutes a challenging nonconvex polynomial optimization problem with strong singularities in the feasible set. Here, we adopt a nonlinear semidefinite programming formulation, which consists of a minimization of a linear function over a basic semi-algebraic feasible set, and provide its bilevel reformulation. This bilevel program maintains a special structure: Th...
September 24, 2018
In this article we provide an experimental algorithm that in many cases gives us an upper bound of the global infimum of a real polynomial on $\R^{n}$. It is very well known that to find the global infimum of a real polynomial on $\R^{n}$, often reduces to solve a hierarchy of positive semidefinite programs, called moment relaxations. The algorithm that we present involves to solve a series of positive semidefinite programs whose feasible set is included in the feasible set o...
June 9, 2017
We introduce a new approach aiming at computing approximate optimal designs for multivariate polynomial regressions on compact (semi-algebraic) design spaces. We use the moment-sum-of-squares hierarchy of semidefinite programming problems to solve numerically the approximate optimal design problem. The geometry of the design is recovered via semidefinite programming duality theory. This article shows that the hierarchy converges to the approximate optimal design as the order ...
March 23, 2023
Framework materials and their deformations provide a compelling relation between materials science and algebraic geometry. Physical distance constraints within the material transform into polynomial constraints, making algebraic geometry and associated numerical strategies feasible for finding equilibrium configurations and deformation pathways. In this paper, we build the necessary geometric formulations and numerical strategies to explore the mechanics of two examples of 3-...
January 26, 2015
A (unit norm) frame is scalable if its vectors can be rescaled so as to result into a tight frame. Tight frames can be considered optimally conditioned because the condition number of their frame operators is unity. In this paper we reformulate the scalability problem as a convex optimization question. In particular, we present examples of various formulations of the problem along with numerical results obtained by using our methods on randomly generated frames.
August 10, 2011
Finite frames can be viewed as mass points distributed in $N$-dimensional Euclidean space. As such they form a subclass of a larger and rich class of probability measures that we call probabilistic frames. We derive the basic properties of probabilistic frames, and we characterize one of their subclasses in terms of minimizers of some appropriate potential function. In addition, we survey a range of areas where probabilistic frames, albeit, under different names, appear. Thes...
November 17, 2013
This paper studies the hierarchy of local minimums of a polynomial in the space. For this purpose, we first compute H-minimums, for which the first and second order optimality conditions are satisfied. To compute each H-minimum, we construct a sequence of semidefinite relaxations, based on optimality conditions. We prove that each constructed sequence has finite convergence, under some generic conditions. A procedure for computing all local minimums is given. When there are e...
June 16, 2021
This paper considers structural optimization under a reliability constraint, where the input distribution is only partially known. Specifically, when we only know that the expected value vector and the variance-covariance matrix of the input distribution belong to a given convex set, we require that, for any realization of the input distribution, the failure probability of a structure should be no greater than a specified target value. We show that this distributionally-robus...