2006
DOI: 10.1007/s10898-005-3249-2
|View full text |Cite
|
Sign up to set email alerts
|

A Combined Global & Local Search (CGLS) Approach to Global Optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
42
0

Year Published

2006
2006
2015
2015

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 29 publications
(42 citation statements)
references
References 25 publications
0
42
0
Order By: Relevance
“…In Sect. 3 we review the background and show that the problem fulfils the conditions in [7] to apply the advanced derivative-free algorithms in [6]. In Sect.…”
Section: Introductionmentioning
confidence: 94%
See 1 more Smart Citation
“…In Sect. 3 we review the background and show that the problem fulfils the conditions in [7] to apply the advanced derivative-free algorithms in [6]. In Sect.…”
Section: Introductionmentioning
confidence: 94%
“…This paper has a two fold objective: (i) to adapt a non-monotone derivative-free optimization technique that has recently appeared in the literature [6] and (ii) to compare its performance with standard approaches. We formulate and solve a computationally appealing optimization model that fulfills a desired quality of service (QoS) in the coverage area.…”
Section: Introductionmentioning
confidence: 99%
“…The agent has not too much time to explore the space of values of CreditLimit, since a delay in the convergence to the right value could cause throughput loses. In this framework, we consider that evolutive algorithms perform enough good and somehow simpler than other more sophisticated optimization techniques [17]. An evolutive algorithm considers a population that evolves on three phases: couple selection, crossover and sporadically mutation.…”
Section: Learning Creditlimitmentioning
confidence: 99%
“…Therefore, an approach that combines thestrengths of stochastic and deterministic optimization schemes but avoids their weaknesses is of much interest. For details on such an approach, see (Noel 2012;Yiu et al 2004;Garcia-Palomares et al 2006). In this section, a hybrid algorithm, which combines the strengths of a gradientbased optimization technique and ABC algorithm, will be presented.…”
mentioning
confidence: 99%