Results 11 to 20 of about 18,713 (263)
A sequential approximation framework for coded distributed optimization [PDF]
Building on the previous work of Lee et al. and Ferdinand et al. on coded computation, we propose a sequential approximation framework for solving optimization problems in a distributed manner. In a distributed computation system, latency caused by individual processors ("stragglers") usually causes a significant delay in the overall process.
Jingge Zhu +4 more
openaire +3 more sources
Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems
Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing.
Ivan Sergienko +3 more
doaj +1 more source
Design Optimization of Multibody Systems by Sequential Approximation
We propose to couple the multibody analysis and optimization algorithm by approximation concepts. The basic idea is to generate approximations of objective function and constraints in a certain part of the design space, and to find the optimum point for this approximate optimization problem.
Etman, L.F.P. +2 more
openaire +2 more sources
Blank shape minimizing earing, which is trimmed off after forming, is an important issue in sheet metal forming. In addition, blank holder force (BHF) have an influence on the product quality.
Kiichiro KAWAMOTO +6 more
doaj +1 more source
Simple Case Study on Radius of Radial Basis Function Network for Sequential Approximate Optimization
Radial basis function (RBF) networks are used for various research field. Especially, they make handling easy for classification and function approximation due to their mathematical form.
Yoshiaki Katada
doaj +1 more source
Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem [PDF]
The aim of this paper is to establish sequential necessary and sufficient approximate optimality conditions for a constrained convex vector mini-mization problem without any constraint qualifications, characterizing the approximate proper and weak ...
A. Ed-dahdah +3 more
doaj +1 more source
On the approximation of some optimal sequential plan [PDF]
The paper is concerned with the problem of sequential estimating the parameter of the drift coefficient in stochastic diffusion processes and fields. We consider the models when drift is known up to a multiplicative constant. For such models \textit{A. A. Novikov} [Theor. Probab. Appl. 16, 391-393 (1971); translation from Teor. Veroyatn. Primen.
openaire +2 more sources
Bayesian Optimization is a sequential method for obtaining the maximum of an unknown function that has gained much popularity in recent years. Bayesian Optimization is commonly used to monitor the surface of large-scale aquatic environments using an ...
Federico Peralta Samaniego +4 more
doaj +1 more source
In this paper, the approximate Bayesian computation combines the particle swarm optimization and sequential Monte Carlo methods, which identify the parameters of the Mathieu-van der Pol-Duffing chaotic energy harvester system. Then the proposed method is
Di Liu, Shen Xu, Jinzhong Ma
doaj +1 more source
In this paper, the initial blank shape is optimized via sequential approximate optimization (SAO) with radial basis function (RBF) network. In deep drawing, the wrinkling and tearing are major defects.
Jirasak SRIRAT +2 more
doaj +1 more source

