• No results found

local optima

Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction

Breaking Out of Local Optima with Count Transforms and Model Recombination: A Study in Grammar Induction

... for local model search ...in local optima, whereas samplers may be ...individual local opti- mizers into organized ...already-found local optima; and (ii) join, which merges ...

13

Regularized M-estimators with Nonconvexity: Statistical and Algorithmic Theory for Local Optima

Regularized M-estimators with Nonconvexity: Statistical and Algorithmic Theory for Local Optima

... loss, modulo a constant factor. Much existing work, including that of Fan and Li (2001) and Zhang and Zhang (2012), first establishes statistical consistency results concerning global minima of the program (12), then ...

58

Escaping Local Optima Using Crossover with Emergent Diversity

Escaping Local Optima Using Crossover with Emergent Diversity

... The question to what degree the interplay between both crossover and mutation promotes the natural emergence of diversity in the population has been so far open. Our analysis shows that this interplay on the plateau of ...

14

Online Full Text

Online Full Text

... multiple local optima, is desirable in many fields such as engineering design, computer science, operations research, biomedicine, computational chemistry, ...

5

SCALABLE HIGH PERFORMANCE MULTIDIMENSIONAL SCALING

SCALABLE HIGH PERFORMANCE MULTIDIMENSIONAL SCALING

... avoid local optima by DA-SMACOF, we would like to look into the STRESS value progress of SMACOF and DA-exp95 with the ε = 10 − 6 stop condition in the 2D and 3D mapping ...

159

Robust Real Time Stereoscopic Alignment

Robust Real Time Stereoscopic Alignment

... Figure 3 shows a top down view of the search space. Darker colours indicate a better match than lighter colours. This data has not been scaled and is the raw output from the algorithm that is indiscriminate of number of ...

8

Improvement of Artificial Bee Colony Algorithm Based on Self Adaptive Random Optimization Strategy

Improvement of Artificial Bee Colony Algorithm Based on Self Adaptive Random Optimization Strategy

... into local optima in the later period, an improved algorithm based on the self-adaptive random optimization strategy was proposed to improve the local search ability of the algorithm by taking ...

5

The influence of search components and problem characteristics in early life cycle class modelling

The influence of search components and problem characteristics in early life cycle class modelling

... fewer local optima are sampled during ...of local optima and their distance from the global optima (and hence from other low cost solutions) shown in ...from local optima ...

31

Comparison among Five Bio inspired Optimization Techniques for Designing Hybrid Optimization Algorithms

Comparison among Five Bio inspired Optimization Techniques for Designing Hybrid Optimization Algorithms

... are local search and global ...have local search and global search operators, however each has distinct ways to update new ...from local optima, especially as the number of individuals in ...

6

Finding and Choosing among Multiple Optima

Finding and Choosing among Multiple Optima

... Black box functions, such as computer experiments, often have multiple optima over the input space of the ob- jective function. While traditional optimization routines focus on finding a single best optimum, we ...

18

Private information alone can trigger trapping of ant colonies in local feeding optima

Private information alone can trigger trapping of ant colonies in local feeding optima

... Our results demonstrate that an iconic phenomenon in collective decision making – trapping in local optima – can occur even after existing social information (trail pheromones) is removed. Even without ...

8

A Cluster-based Evolutionary Algorithm for the Single Machine Total Weighted Tardiness-scheduling Problem

A Cluster-based Evolutionary Algorithm for the Single Machine Total Weighted Tardiness-scheduling Problem

... two local search stages. During the first stage it estimates some local optima by ...global optima is easy to find, it is enough to form only two ...the local optima hardly ...

7

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

... solution in a probabilistic way. In other word, VNS applies a local search procedure repeatedly to get from neighboring solutions to local optima [51]. Because of relying[r] ...

14

Rugged NK landscapes contain the highest peaks

Rugged NK landscapes contain the highest peaks

... of local op- tima regresses to the mean of the landscape with increasing epistasis, ...the local optima ...the optima that are found reflect the local optima that exist in the ...

6

Bounds on  $m_r(2,29)$

Bounds on $m_r(2,29)$

... observations. The cost function is chosen to favor as local optima arcs with a small number of r-secants. The computation times are in order of several minutes up to a few hours on a PC. Similar techniques ...

12

Populations can be essential in tracking dynamic optima

Populations can be essential in tracking dynamic optima

... Abstract Real-world optimisation problems are often dynamic. Previously good solu- tions must be updated or replaced due to changes in objectives and constraints. It is often claimed that evolutionary algorithms are ...

21

Wear and Friction of UHMWPE-on-PEEK OPTIMA™

Wear and Friction of UHMWPE-on-PEEK OPTIMA™

... Experimental wear simulation was carried out using a 6-station multi-axial pin-on-plate reciprocating rig (Figure 1) [32]. The cobalt chrome or PEEK-OPTIMA (PEEK) plate was held in a lubricant containing bath ...

18

Cluster Search Algorithm for Finding Multiple Optima

Cluster Search Algorithm for Finding Multiple Optima

... the optima once they are found, but the search for multiple optima can be rather expensive in terms of time required to compute Black Box function values at input ...

17

Lower Bounds for the Average and Smoothed Number of Pareto-Optima

Lower Bounds for the Average and Smoothed Number of Pareto-Optima

... Proof of Theorem 1.3. To show our lower bound we will use the obvious one-to-one map between our basic problem with d objectives and the profits of the knapsack problem: let v (1) , . . . , v (d) be an instance of our ...

20

Free search in tracking time dependent optima

Free search in tracking time dependent optima

... The animals in this algorithm are mobile. Each animal can operate either with small precise steps (local search) or with large steps (global exploration). Each animal decides how to search: with small or with ...

7

Show all 10000 documents...

Related subjects