Adaptive search space decomposition method for pre- and post- buckling
analyses of space truss structures
- URL: http://arxiv.org/abs/2211.07519v1
- Date: Mon, 14 Nov 2022 16:47:25 GMT
- Title: Adaptive search space decomposition method for pre- and post- buckling
analyses of space truss structures
- Authors: Varun Ojha, Bartolomeo Panto, and Giuseppe Nicosia
- Abstract summary: The paper proposes a novel adaptive search space decomposition method and a gradient-free optimization-based formulation for the pre- and post-buckling analyses.
We tackle three benchmark problems and evaluate a medium-sized test representing a real structural problem in this paper.
The accuracy and robustness of the adopted methodology show a high potential of gradient-free algorithms in analyzing space truss structures.
- Score: 0.7537475180985098
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: The paper proposes a novel adaptive search space decomposition method and a
novel gradient-free optimization-based formulation for the pre- and
post-buckling analyses of space truss structures. Space trusses are often
employed in structural engineering to build large steel constructions, such as
bridges and domes, whose structural response is characterized by large
displacements. Therefore, these structures are vulnerable to progressive
collapses due to local or global buckling effects, leading to sudden failures.
The method proposed in this paper allows the analysis of the load-equilibrium
path of truss structures to permanent and variable loading, including stable
and unstable equilibrium stages and explicitly considering geometric
nonlinearities. The goal of this work is to determine these equilibrium stages
via optimization of the Lagrangian kinematic parameters of the system,
determining the global equilibrium. However, this optimization problem is
non-trivial due to the undefined parameter domain and the sensitivity and
interaction among the Lagrangian parameters. Therefore, we propose formulating
this problem as a nonlinear, multimodal, unconstrained, continuous optimization
problem and develop a novel adaptive search space decomposition method, which
progressively and adaptively re-defines the search domain (hypersphere) to
evaluate the equilibrium of the system using a gradient-free optimization
algorithm. We tackle three benchmark problems and evaluate a medium-sized test
representing a real structural problem in this paper. The results are compared
to those available in the literature regarding displacement-load curves and
deformed configurations. The accuracy and robustness of the adopted methodology
show a high potential of gradient-free algorithms in analyzing space truss
structures.
Related papers
- Gradient-free neural topology optimization [0.0]
gradient-free algorithms require many more iterations to converge when compared to gradient-based algorithms.
This has made them unviable for topology optimization due to the high computational cost per iteration and high dimensionality of these problems.
We propose a pre-trained neural reparameterization strategy that leads to at least one order of magnitude decrease in iteration count when optimizing the designs in latent space.
arXiv Detail & Related papers (2024-03-07T23:00:49Z) - Constrained Optimization via Exact Augmented Lagrangian and Randomized
Iterative Sketching [55.28394191394675]
We develop an adaptive inexact Newton method for equality-constrained nonlinear, nonIBS optimization problems.
We demonstrate the superior performance of our method on benchmark nonlinear problems, constrained logistic regression with data from LVM, and a PDE-constrained problem.
arXiv Detail & Related papers (2023-05-28T06:33:37Z) - Adaptive Stochastic Optimisation of Nonconvex Composite Objectives [2.1700203922407493]
We propose and analyse a family of generalised composite mirror descent algorithms.
With adaptive step sizes, the proposed algorithms converge without requiring prior knowledge of the problem.
We exploit the low-dimensional structure of the decision sets for high-dimensional problems.
arXiv Detail & Related papers (2022-11-21T18:31:43Z) - On the Sparse DAG Structure Learning Based on Adaptive Lasso [39.31370830038554]
We develop a data-driven DAG structure learning method without the predefined threshold, called adaptive NOTEARS [30]
We show that adaptive NOTEARS enjoys the oracle properties under some specific conditions. Furthermore, simulation results validate the effectiveness of our method, without setting any gap of edges around zero.
arXiv Detail & Related papers (2022-09-07T05:47:59Z) - Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives [1.7640556247739623]
We analyze algorithms for zeroth-order entropy composite objectives, focusing on dependence on dimensionality.
This is achieved by exploiting low dimensional structure of the decision set using the mirror descent method with an estimation alike function.
To improve the gradient, we replace the classic sampling method based on Rademacher and show that the mini-batch method copes with non-Eucli geometry.
arXiv Detail & Related papers (2022-08-09T07:36:25Z) - A Priori Denoising Strategies for Sparse Identification of Nonlinear
Dynamical Systems: A Comparative Study [68.8204255655161]
We investigate and compare the performance of several local and global smoothing techniques to a priori denoise the state measurements.
We show that, in general, global methods, which use the entire measurement data set, outperform local methods, which employ a neighboring data subset around a local point.
arXiv Detail & Related papers (2022-01-29T23:31:25Z) - Unified Convergence Analysis for Adaptive Optimization with Moving Average Estimator [75.05106948314956]
We show that an increasing large momentum parameter for the first-order moment is sufficient for adaptive scaling.
We also give insights for increasing the momentum in a stagewise manner in accordance with stagewise decreasing step size.
arXiv Detail & Related papers (2021-04-30T08:50:24Z) - Pushing the Envelope of Rotation Averaging for Visual SLAM [69.7375052440794]
We propose a novel optimization backbone for visual SLAM systems.
We leverage averaging to improve the accuracy, efficiency and robustness of conventional monocular SLAM systems.
Our approach can exhibit up to 10x faster with comparable accuracy against the state-art on public benchmarks.
arXiv Detail & Related papers (2020-11-02T18:02:26Z) - Efficient Methods for Structured Nonconvex-Nonconcave Min-Max
Optimization [98.0595480384208]
We propose a generalization extraient spaces which converges to a stationary point.
The algorithm applies not only to general $p$-normed spaces, but also to general $p$-dimensional vector spaces.
arXiv Detail & Related papers (2020-10-31T21:35:42Z) - A Dynamical Systems Approach for Convergence of the Bayesian EM
Algorithm [59.99439951055238]
We show how (discrete-time) Lyapunov stability theory can serve as a powerful tool to aid, or even lead, in the analysis (and potential design) of optimization algorithms that are not necessarily gradient-based.
The particular ML problem that this paper focuses on is that of parameter estimation in an incomplete-data Bayesian framework via the popular optimization algorithm known as maximum a posteriori expectation-maximization (MAP-EM)
We show that fast convergence (linear or quadratic) is achieved, which could have been difficult to unveil without our adopted S&C approach.
arXiv Detail & Related papers (2020-06-23T01:34:18Z) - Convergence and sample complexity of gradient methods for the model-free
linear quadratic regulator problem [27.09339991866556]
We show that ODE searches for optimal control for an unknown computation system by directly searching over the corresponding space of controllers.
We take a step towards demystifying the performance and efficiency of such methods by focusing on the gradient-flow dynamics set of stabilizing feedback gains and a similar result holds for the forward disctization of the ODE.
arXiv Detail & Related papers (2019-12-26T16:56:59Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.