Space partitioning for accelerating efficient global optimization 45
Accelerating ADMM for efficient simulation and optimization
... Anderson acceleration. Anderson acceleration [Walker and Ni 2011] is an established technique to speed up the convergence of a fixed-point iteration. It was first proposed in [Anderson 1965] for solving nonlinear ...
21
Self-organized space partitioning for multi-agent optimization
... la partition de l’espace avec métamodèle local permet de représenter des modèles dont le com- portement varie dans l’espace (modèles non sta- tionnaires au sens des processus aléatoires). A titre d’exemple imagé, on peut ...
18
Efficient Shape Optimization of Space Trusses
... In all the cases, for the supporting arch and the double-layer truss, the solution procedure was stable. As shown, a gradient-based algorithm can perform the optimization very efficiently. However, in shape-design ...
19
Convergence Rates of Efficient Global Optimization Algorithms
... the efficient global optimization problem, we minimize an unknown function f , using as few ob- servations f (x) as ...associated space of functions, its reproducing-kernel Hilbert ...
26
Entropy Search for Information-Efficient Global Optimization
... In the previous section, the algorithms attempted to find minima of functions sampled from the prior used by the algorithms themselves. In real applications, one can rarely hope to be so lucky, but hierarchical inference ...
29
Efficient Global Optimization using Deep Gaussian Processes
... design optimization problems, the objective functions or constraints vary with a completely different smoothness along the input space, due to the abrupt change of a physical property for ...
13
Accelerating evolutionary construction tree extraction via graph partitioning
... The optimization process starts with a randomly initial- ized population of individual candidates sampled from the problem’s search space (initialization). In each it- eration, candidates are ranked ...
9
Efficient sequential sampling for global optimization in static and dynamic environments
... feasible space, creating a response surface using the available data allows learning of the structure of the landscape by studying the existing correlations amongst ...mentioned optimization techniques, ...
134
Computational Optimization Techniques for Graph Partitioning
... Using Optimization Formulations Despite there being a large body of existing techniques for graph partitioning, a promising new research direction involves formulating graph partitioning problems as ...
98
Search space pruning and global optimization of multiple gravity assist trajectories with deep space manoeuvers
... European Space Agency, Noordwijk, the Netherlands space consists of infeasible, or very undesirable, ...standard global optimization techniques to be applied more successfully to the reduced ...
9
Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits
... A number of variants of DIRECT have been described. 28–32 Several authors have noted that the final (local) convergence of the DIRECT algorithm often is rather slow. Nelson and Papalambros, 28 present an improved scheme ...
14
A classification approach to efficient global optimization in presence of non-computable domains
... design space may not be close to the sought optimum, the EGO eventually visit them because of the infilling ...design space, to explicitly remove design points leading to unphysical or ill-posed prob- lems, ...
31
Accelerating method of global optimization for signomial geometric programming
... Theorem 4. Assume that the above algorithm is infinite, then it generates an infinite sequence of iterations such that along any infinite branch of the branch-and-bound tree any accumulation point of the sequence {LB k } ...
12
Partitioning Data on Features or Samples in Communication-Efficient Distributed Optimization?
... Distributed Optimization of Self- Concordant Empirical Loss, Yuchen Zhang and Lin Xiao, 2015] partitions the input data based on ...allow partitioning on features and show its efficiency both in theory and ...
5
Constraint Handling in Efficient Global Optimization
... 4 RESULTS Demonstration on Sphere4 The Sphere4 problem is a constrained optimization problem of steer- able difficulty. It is used here to demonstrate the difference between the Kriging algorithms. Fig. 5 shows ...
8
Effective and Efficient Re-optimization Method for Data-Stream Partitioning at Runtime
... process, partitioning input streams in keeping with the values of specific attributes, or partitioning keys a program with multiple queries is ...different partitioning keys to different queries ...
7
Testing approaches for global optimization of space trajectories
... One of the interesting outcomes of both studies was that DE performed particularly well on most of the problems, compared to other methods. In both studies, the indexes of performance for stochastic methods were: the ...
10
Efficient Global Optimization: Motivation, Variations, and Applications
... popular optimization method of a black box objective function is Efficient Global Optimization (EGO), also known as Sequential Model Based Optimization, SMBO, with kriging and expected ...
26
Accelerating Design Space Exploration
... Abstract: The size of search spaces in embedded sys- tem design is one of the most critical problems during de- sign space exploration. Pareto-Front Arithmetics (PFA) has shown to be useful to overcome this ...
6
Partitioning space for range queries
... With this data structure and its refinements, efficient solutions to various range query problems in 2 and 3 dimensions can be obtained, including (1) half-space queries: find all poin[r] ...
21