• No results found

efficient global optimization methods

Identification of metabolic system parameters using global optimization methods

Identification of metabolic system parameters using global optimization methods

... the efficient estimation of parameters, which in the case of GMA and S-systems within BST can directly be interpreted as biological fea- tures, thereby potentially yielding novel ...nonlinear optimization ...

15

Convergence Rates of Efficient Global Optimization Algorithms

Convergence Rates of Efficient Global Optimization Algorithms

... We may therefore ask if there are more efficient methods, with better average-case performance, that nevertheless provide good guarantees of convergence. The difficulty in designing such a method lies in ...

26

Derivative-Free Efficient Global Optimization of Function of Parameters from Bounded Intervals.

Derivative-Free Efficient Global Optimization of Function of Parameters from Bounded Intervals.

... existing optimization algorithms, the main motivation is to minimize the number of function evaluations required to find a reasonable local minimum ...the global minimum is our main ...non-convex ...

26

Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits

Efficient algorithms for multidimensional global optimization in genetic mapping of complex traits

... the global optima for the 115 test problems, in total 65 proved to be ...local optimization was applied was that at least 43627 out of the 64739 boxes tested were ...based optimization methods ...

14

Efficient Trust Region Methods for Nonconvex Optimization

Efficient Trust Region Methods for Nonconvex Optimization

... attain global and fast local convergence ...second-order methods for minimizing a particular class of sufficiently smooth objective functions in the optimization problem ...

177

Efficient Global Optimization: Motivation, Variations, and Applications

Efficient Global Optimization: Motivation, Variations, and Applications

... the optimization of expensive black box func- ...simple methods for the handling of categorical variables, and we discussed focus search for the optimization of the infill ...and optimization ...

26

Efficient sequential sampling for global optimization in static and dynamic environments

Efficient sequential sampling for global optimization in static and dynamic environments

... aided global optimization process is to exploit further, at each iteration, the readily available model by determining the next q samples, instead of just the next ...existing methods, we present a ...

134

Scalable design synthesis for automotive assembly system

Scalable design synthesis for automotive assembly system

... with optimization routines such as linear programming, genetic algorithms ...layout optimization (Menassa & DeVries, 1991; Kashyap & DeVries, 1999; Camelio, et ...cases, efficient ...

297

A Review on Surrogate-Based Global Optimization Methods for Computationally Expensive Functions

A Review on Surrogate-Based Global Optimization Methods for Computationally Expensive Functions

... surrogate-based global optimization. This optimization process starts with generating an initial sample set through using a certain design of experiments ...surrogate-based global ...

17

Entropy Search for Information-Efficient Global Optimization

Entropy Search for Information-Efficient Global Optimization

... convex optimization, often encountered as a sub-problem of machine learning ...Newton methods (Broyden, 1965; Fletcher, 1970; Goldfarb, 1970; Shanno, 1970), the conjugate gradient method (Hestenes and ...

29

Vol 15, No 3 (2015)

Vol 15, No 3 (2015)

... the optimization methods for faster ...ensures global convergence within the flight envelope for the generation of equilibrium ...for optimization methods and Barycentric interpolation ...

19

SimpleMKL

SimpleMKL

... convex optimization problem, with convergent methods starting from the same initialization, the observed differences are only due to the inaccuracy of the solution when the stopping criterion is ...

34

A Hybrid Energy Model for Region Based Curve Evolution - Application to CTA Coronary Segmentation

A Hybrid Energy Model for Region Based Curve Evolution - Application to CTA Coronary Segmentation

... Methods: The proposed hybrid energy couples an intensity-based local term with an efficient discontinuity-based global model of the image for optimal seg- mentation. The segmentation is achieved ...

40

A New Nonlinear Conjugate Gradient Method Based on the Scaled Matrix

A New Nonlinear Conjugate Gradient Method Based on the Scaled Matrix

... These methods have strong convergence properties, but they may have modest practical performance due to ...the methods of Polak and Ribiere (PR) [11], Hestenes and Stiefel (HS) [8], and Liu and Storey, (LS) ...

6

Accelerations for a variety of global optimization methods

Accelerations for a variety of global optimization methods

... Methods using only the M -cone produce lower bounding functions which are very poor local approximations to the graph (if the minimum is smooth). This is quite apparent in column one of Table 1. Of course an ...

11

Comparative analysis of methods of recovering the well flow-rate and water-cut by thermodynamic measurements

Comparative analysis of methods of recovering the well flow-rate and water-cut by thermodynamic measurements

... Knowing the pressure and temperature in the well is necessary for the development of systems for collecting and transporting petroleum products, calculating the temperature conditions of pumps, designing systems, and ...

7

Image reconstruction of fluorescent molecular tomography based on the tree structured Schur complement decomposition

Image reconstruction of fluorescent molecular tomography based on the tree structured Schur complement decomposition

... the i+1th level will be more efficient than solving it at the ith level. We herein solve equation (29) using the biconjugate gradient method [23]. Its advantage is that it does not square the condition number of ...

19

A two-fly tracker that solves occlusions by dynamic programming: computational analysis of Drosophila courtship behaviour

A two-fly tracker that solves occlusions by dynamic programming: computational analysis of Drosophila courtship behaviour

... This paper introduces a two-fly tracker that provides solu- tions for all major challenges in insect tracking: arena detection, segmentation, resolving occlusions, resolving heading and event detections. It was designed ...

16

Visual SLAM algorithms: a survey from 2010 to 2016

Visual SLAM algorithms: a survey from 2010 to 2016

... In order to do this, 2D–3D correspondences between the image and the map are first obtained from feature match- ing or feature tracking in the image. Then, the camera pose is computed from the correspondences by solving ...

11

Distributed Algorithms in Large-scaled Empirical Risk Minimization: Non-convexity, Adaptive-sampling, and Matrix-free Second-order Methods

Distributed Algorithms in Large-scaled Empirical Risk Minimization: Non-convexity, Adaptive-sampling, and Matrix-free Second-order Methods

... dimensional optimization, has been studied for decades ...Hessian-free optimization, and such Hessian-free optimization is exactly used in Marten’s HF [51] ...

148

Show all 10000 documents...

Related subjects