ID: 1909.07179

On optimum design of frame structures

September 16, 2019

View on ArXiv
Marek Tyburec, Jan Zeman, Martin Kružík, Didier Henrion
Mathematics
Optimization and Control

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

Global optimality in minimum compliance topology optimization of frames and shells by moment-sum-of-squares hierarchy

September 26, 2020

91% Match
Marek Tyburec, Jan Zeman, ... , Henrion Didier
Optimization and Control

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...

Find SimilarView on arXiv

Global weight optimization of frame structures with polynomial programming

November 25, 2022

91% Match
Marek Tyburec, Michal Kočvara, Martin Kružík
Optimization and Control

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...

Find SimilarView on arXiv

Global weight optimization of frame structures under free-vibration eigenvalue constraints

May 14, 2024

89% Match
Marek Tyburec, Michal Kočvara, ... , Zeman Jan
Optimization and Control

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...

Find SimilarView on arXiv

An experimental approach for global polynomial optimization based on Moments and Semidefinite Programming

September 24, 2018

84% Match
María López Quijorna
Optimization and Control

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...

Find SimilarView on arXiv

Approximate Optimal Designs for Multivariate Polynomial Regression

June 9, 2017

84% Match
Castro Yohann De, Fabrice Gamboa, Didier Henrion, ... , Lasserre Jean-Bernard
math.ST
cs.IT
math.IT
math.NA
stat.CO
stat.ME
stat.TH

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 ...

Find SimilarView on arXiv

Robust geometric modeling of 3-periodic tensegrity frameworks using Riemannian optimization

March 23, 2023

83% Match
Matthias Himmelmann, Myfanwy E. Evans
Algebraic Geometry
Optimization and Control

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-...

Find SimilarView on arXiv

On Optimal Frame Conditioners

January 26, 2015

83% Match
Chae A. Clark, Kasso A. Okoudjou
Numerical Analysis
Optimization and Control

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.

Find SimilarView on arXiv

Probabilistic frames: An overview

August 10, 2011

83% Match
Martin Ehler, Kasso A. Okoudjou
Probability
Functional Analysis

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...

Find SimilarView on arXiv

The Hierarchy of Local Minimums in Polynomial Optimization

November 17, 2013

83% Match
Jiawang Nie
Optimization and Control

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...

Find SimilarView on arXiv

Structural reliability under uncertainty in moments: distributionally-robust reliability-based design optimization

June 16, 2021

83% Match
Yoshihiro Kanno
Optimization and Control

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...

Find SimilarView on arXiv