scholarly journals Design of a Segmented Mirror with a Global Radius of Curvature Actuation System: Contributions of Multiple Surrogates

2020 ◽  
Vol 10 (23) ◽  
pp. 8375
Author(s):  
Songhang Wu ◽  
Jihong Dong ◽  
Shuyan Xu ◽  
Zhirong Lu ◽  
Boqian Xu
Keyword(s):  
Numerical Simulations ◽  
Optimization Problems ◽  
Computational Cost ◽  
Surface Shape ◽  
Radius Of Curvature ◽  
Shape Error ◽  
Direct Optimization ◽  
Actuation System ◽  
Polynomial Response Surface ◽  
Segmented Mirror

Due to fabrication difficulties, separately-polished segmented mirrors cannot meet the co-phasing surface shape error requirements in the segmented telescope system. Applying the global radius of curvature (GRoC) actuation system for the individual segments has become an effective solution in space-based telescopes. In this paper, we designed a segmented mirror with a GRoC actuation system. The direct optimization by numerical simulations has low computational efficiency and is not easy to converge for optimizing the actuation point’s position on the segmented mirror. For this problem, three common surrogates, including polynomial response surface (PRS), radial basis function neural network (RBFNN), and kriging (KRG), were summed to propose the multiple surrogates (MS) which have the higher approximate ability. The surrogates were then optimized through the multi-island genetic algorithm (MIGA), and the segmented mirror met the design requirement. Compared with direct optimization through numerical simulations, the results show that the proposed multiple-surrogate-based optimization (MSBO) methodology saves computational cost significantly. Besides, it can be deployed to solve other complex optimization problems.

Optimization of a segmented mirror with a global radius of curvature actuation system based on multi-fidelity surrogates

Optik ◽  
2021 ◽  
pp. 166741
Author(s):  
Songhang Wu ◽  
Jihong Dong ◽  
Shuyan Xu ◽  
Zhirong Lu ◽  
Boqian Xu
Keyword(s):  
Radius Of Curvature ◽  
Actuation System ◽  
Segmented Mirror

Reliability and reliability-based sensitivity analysis of self-centering buckling restrained braces using meta-models

2021 ◽  
pp. 1045389X2110263
Author(s):  
Seyede Vahide Hashemi ◽  
Mahmoud Miri ◽  
Mohsen Rashki ◽  
Sadegh Etedali
Keyword(s):  
Failure Probability ◽  
Limit State ◽  
Computational Cost ◽  
Sensitivity Analyses ◽  
State Function ◽  
Reliability Indices ◽  
Buckling Restrained Brace ◽  
Polynomial Response Surface ◽  
Nonlinear Dynamic Analyses ◽  
High Computational Cost

This paper aims to carry out sensitivity analyses to study how the effect of each design variable on the performance of self-centering buckling restrained brace (SC-BRB) and the corresponding buckling restrained brace (BRB) without shape memory alloy (SMA) rods. Furthermore, the reliability analyses of BRB and SC-BRB are performed in this study. Considering the high computational cost of the simulation methods, three Meta-models including the Kriging, radial basis function (RBF), and polynomial response surface (PRSM) are utilized to construct the surrogate models. For this aim, the nonlinear dynamic analyses are conducted on both BRB and SC-BRB by using OpenSees software. The results showed that the SMA area, SMA length ratio, and BRB core area have the most effect on the failure probability of SC-BRB. It is concluded that Kriging-based Monte Carlo Simulation (MCS) gives the best performance to estimate the limit state function (LSF) of BRB and SC-BRB in the reliability analysis procedures. Considering the effects of changing the maximum cyclic loading on the failure probability computation and comparison of the failure probability for different LSFs, it is also found that the reliability indices of SC-BRB were always higher than the corresponding reliability indices determined for BRB which confirms the performance superiority of SC-BRB than BRB.

scholarly journals Concurrent material and structure optimization of multiphase hierarchical systems within a continuum micromechanics framework

2021 ◽  
Author(s):  
Tarun Gangwar ◽  
Dominik Schillinger
Keyword(s):  
Optimization Problems ◽  
Computational Cost ◽  
Structure Optimization ◽  
Material Behavior ◽  
Hierarchical Systems ◽  
Material Optimization ◽  
Continuum Micromechanics ◽  
Benchmark Tests ◽  
Constraint Optimization Problems ◽  
First Time

AbstractWe present a concurrent material and structure optimization framework for multiphase hierarchical systems that relies on homogenization estimates based on continuum micromechanics to account for material behavior across many different length scales. We show that the analytical nature of these estimates enables material optimization via a series of inexpensive “discretization-free” constraint optimization problems whose computational cost is independent of the number of hierarchical scales involved. To illustrate the strength of this unique property, we define new benchmark tests with several material scales that for the first time become computationally feasible via our framework. We also outline its potential in engineering applications by reproducing self-optimizing mechanisms in the natural hierarchical system of bamboo culm tissue.

scholarly journals Optimization of injection molding process for car fender in consideration of energy efficiency and product quality

2014 ◽  
Vol 1 (4) ◽  
pp. 256-265 ◽  
Author(s):  
Hong Seok Park ◽  
Trung Thanh Nguyen
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Injection Molding ◽  
Product Quality ◽  
Process Parameters ◽  
Optimization Problems ◽  
Computational Cost ◽  
Injection Molding Process ◽  
Molding Process ◽  
Nsga Ii

Abstract Energy efficiency is an essential consideration in sustainable manufacturing. This study presents the car fender-based injection molding process optimization that aims to resolve the trade-off between energy consumption and product quality at the same time in which process parameters are optimized variables. The process is specially optimized by applying response surface methodology and using nondominated sorting genetic algorithm II (NSGA II) in order to resolve multi-object optimization problems. To reduce computational cost and time in the problem-solving procedure, the combination of CAE-integration tools is employed. Based on the Pareto diagram, an appropriate solution is derived out to obtain optimal parameters. The optimization results show that the proposed approach can help effectively engineers in identifying optimal process parameters and achieving competitive advantages of energy consumption and product quality. In addition, the engineering analysis that can be employed to conduct holistic optimization of the injection molding process in order to increase energy efficiency and product quality was also mentioned in this paper.

Convergence analysis of online learning algorithm with two-stage step size

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Weilin Nie ◽  
Cheng Wang
Keyword(s):  
Online Learning ◽  
Optimization Problems ◽  
Learning Algorithm ◽  
Computational Cost ◽  
Reproducing Kernels ◽  
Step Size ◽  
Two Stage ◽  
Logarithmic Term ◽  
Convergence Performance ◽  
Online Learning Algorithm

Abstract Online learning is a classical algorithm for optimization problems. Due to its low computational cost, it has been widely used in many aspects of machine learning and statistical learning. Its convergence performance depends heavily on the step size. In this paper, a two-stage step size is proposed for the unregularized online learning algorithm, based on reproducing Kernels. Theoretically, we prove that, such an algorithm can achieve a nearly min–max convergence rate, up to some logarithmic term, without any capacity condition.

Multirow Intersection Cuts Based on the Infinity Norm

2021 ◽  
Author(s):  
Álinson S. Xavier ◽  
Ricardo Fukasawa ◽  
Laurent Poirrier
Keyword(s):  
Optimization Problems ◽  
Valid Inequalities ◽  
Linear Optimization ◽  
Computational Cost ◽  
General Purpose ◽  
Mixed Integer ◽  
Infinity Norm ◽  
Intersection Cuts ◽  
Linear Optimization Problems ◽  
Mixed Integer Linear Optimization

When generating multirow intersection cuts for mixed-integer linear optimization problems, an important practical question is deciding which intersection cuts to use. Even when restricted to cuts that are facet defining for the corner relaxation, the number of potential candidates is still very large, especially for instances of large size. In this paper, we introduce a subset of intersection cuts based on the infinity norm that is very small, works for relaxations having arbitrary number of rows and, unlike many subclasses studied in the literature, takes into account the entire data from the simplex tableau. We describe an algorithm for generating these inequalities and run extensive computational experiments in order to evaluate their practical effectiveness in real-world instances. We conclude that this subset of inequalities yields, in terms of gap closure, around 50% of the benefits of using all valid inequalities for the corner relaxation simultaneously, but at a small fraction of the computational cost, and with a very small number of cuts. Summary of Contribution: Cutting planes are one of the most important techniques used by modern mixed-integer linear programming solvers when solving a variety of challenging operations research problems. The paper advances the state of the art on general-purpose multirow intersection cuts by proposing a practical and computationally friendly method to generate them.

EFFECT OF WATER CURRENT ON UNDERWATER GLIDER VELOCITY AND RANGE

2016 ◽  
Vol 78 (10-4) ◽  
Author(s):  
Muhammad Yasar Javaid ◽  
Mark Ovinis ◽  
Fakhruldin Mohd Hashim ◽  
Adi Maimun ◽  
Yasser M. Ahmed ◽  
...  
Keyword(s):  
Steady State ◽  
Numerical Simulations ◽  
Relative Motion ◽  
Water Current ◽  
Underwater Glider ◽  
Water Currents ◽  
Effect Of Water ◽  
Actuation System ◽  
Autonomous Underwater Glider

An autonomous underwater glider speed and range is influenced by water currents. This is compounded by a weak actuation system for controlling its movement. In this work, the effects of water currents on the speed and range of an underwater glider at steady state glide conditions are investigated. Extensive numerical simulations have been performed to determine the speed and range of a glider with and without water current at different net buoyancies. The results show that the effect of water current on the glider speed and range depends on the current relative motion and direction. In the presence of water current, for a given glide angle, glide speed can be increased by increasing the net buoyancy of the glider.

scholarly journals Restricted Boltzmann Machine-Assisted Estimation of Distribution Algorithm for Complex Problems

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-13 ◽  
Author(s):  
Lin Bao ◽  
Xiaoyan Sun ◽  
Yang Chen ◽  
Guangyi Man ◽  
Hui Shao
Keyword(s):  
Optimization Problems ◽  
Probability Model ◽  
Computational Cost ◽  
Evolutionary Process ◽  
Estimation Of Distribution Algorithm ◽  
Restricted Boltzmann Machine ◽  
Model Management ◽  
Boltzmann Machine ◽  
Complex Problems ◽  
Estimation Of Distribution

A novel algorithm, called restricted Boltzmann machine-assisted estimation of distribution algorithm, is proposed for solving computationally expensive optimization problems with discrete variables. First, the individuals are evaluated using expensive fitness functions of the complex problems, and some dominant solutions are selected to construct the surrogate model. The restricted Boltzmann machine (RBM) is built and trained with the dominant solutions to implicitly extract the distributed representative information of the decision variables in the promising subset. The visible layer’s probability of the RBM is designed as the sampling probability model of the estimation of distribution algorithm (EDA) and is updated dynamically along with the update of the dominant subsets. Second, according to the energy function of the RBM, a fitness surrogate is developed to approximate the expensive individual fitness evaluations and participates in the evolutionary process to reduce the computational cost. Finally, model management is developed to train and update the RBM model with newly dominant solutions. A comparison of the proposed algorithm with several state-of-the-art surrogate-assisted evolutionary algorithms demonstrates that the proposed algorithm effectively and efficiently solves complex optimization problems with smaller computational cost.

scholarly journals rpe v5: An emulator for reduced floating-point precision in large numerical simulations

2016 ◽  
Author(s):  
Andrew Dawson ◽  
Peter Düben
Keyword(s):  
Numerical Simulations ◽  
Climate Models ◽  
Numerical Models ◽  
Computational Cost ◽  
Floating Point ◽  
Climate Modelling ◽  
Acceptable Quality ◽  
Weather And Climate ◽  
Code Changes ◽  
Numerical Precision

Abstract. This paper describes the rpe library which has the capability to emulate the use of arbitrary reduced floating-point precision within large numerical models written in Fortran. The rpe software allows model developers to test how reduced floating-point precision affects the result of their simulations without having to make extensive code changes or port the model onto specialised hardware. The software can be used to identify parts of a program that are problematic for numerical precision and to guide changes to the program to allow a stronger reduction in precision. The development of rpe was motivated by the strong demand for more computing power. If numerical precision can be reduced for an application under consideration while still achieving results of acceptable quality, computational cost can be reduced, since a reduction in numerical precision may allow an increase in performance or a reduction in power consumption. For simulations with weather and climate models, savings due to a reduction in precision could be reinvested to allow model simulations at higher spatial resolution or complexity, or to increase the number of ensemble members to improve predictions. rpe was developed with particular focus on the community of weather and climate modelling, but the software could be used with numerical simulations from other domains.

scholarly journals A consensus-based global optimization method for high dimensional machine learning problems

2020 ◽  
Author(s):  
Jose Carrillo ◽  
Shi Jin ◽  
Lei Li ◽  
Yuhua Zhu
Keyword(s):  
Optimization Problems ◽  
Computational Cost ◽  
Weighted Average ◽  
Planck Equation ◽  
Optimization Method ◽  
Learning Problems ◽  
High Dimensional ◽  
Nonconvex Functions ◽  
The Individual ◽  
Parameter Constraints

We improve recently introduced consensus-based optimization method, proposed in [R. Pinnau, C. Totzeck, O. Tse and S. Martin, Math. Models Methods Appl. Sci., 27(01):183{204, 2017], which is a gradient-free optimization method for general nonconvex functions. We rst replace the isotropic geometric Brownian motion by the component-wise one, thus removing the dimensionality dependence of the drift rate, making the method more competitive for high dimensional optimization problems. Secondly, we utilize the random mini-batch ideas to reduce the computational cost of calculating the weighted average which the individual particles tend to relax toward. For its mean- eld limit{a nonlinear Fokker-Planck equation{we prove, in both time continuous and semi-discrete settings, that the convergence of the method, which is exponential in time, is guaranteed with parameter constraints independent of the dimensionality. We also conduct numerical tests to high dimensional problems to check the success rate of the method.

Sign in / Sign up

Export Citation Format

Share Document