1999
DOI: 10.1016/s0020-0255(98)10056-7
|View full text |Cite
|
Sign up to set email alerts
|

An explanation of ordinal optimization: Soft computing for hard problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
172
0

Year Published

2003
2003
2016
2016

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 134 publications
(172 citation statements)
references
References 6 publications
0
172
0
Order By: Relevance
“…The OO theory is a novel approach to cope with the complex and difficult optimization problem and can significantly reduce the number of search samples of the huge feasible solution space formed by all discrete control variables [20,21]. The OO theory aims to obtain sufficiently good solutions with a high probability instead of finding the perfect optimal solutions to avoid time consuming calculation.…”
Section: Oo Theorymentioning
confidence: 99%
See 2 more Smart Citations
“…The OO theory is a novel approach to cope with the complex and difficult optimization problem and can significantly reduce the number of search samples of the huge feasible solution space formed by all discrete control variables [20,21]. The OO theory aims to obtain sufficiently good solutions with a high probability instead of finding the perfect optimal solutions to avoid time consuming calculation.…”
Section: Oo Theorymentioning
confidence: 99%
“…Because the crude evaluation model is much faster than the accurate evaluation, this approach can improve the overall solving efficiency for the complex problem. OO has been applied to optimization problems in the power system [20]. Fig.…”
Section: Oo Theorymentioning
confidence: 99%
See 1 more Smart Citation
“…Simulations suggest that the majority of applications have a Bell shape, which implies that the good-enough data distribution to search is neutral (neither too good nor too bad). The effect of the Bell shape on the final selection set S is described by Ho et al [9] (6) Specify the noise level. Normalize the observed performance in { ( ), 41,42, ,1000}…”
Section: Configuration Autotuning Proceduresmentioning
confidence: 99%
“…1. (8) Use a look-up table [9] to calculate the size, s, of the selection set S. OO theory guarantees that S contains at least k good-enough configuration parameter vectors with a probability no less than α.…”
Section: Configuration Autotuning Proceduresmentioning
confidence: 99%