In this paper we prove a sufficient condition that a strong local minimizer of a bounded quadratic program is the unique global minimizer. This sufficient condition can be verified computationally by solving a linear and a convex quadratic program and can be used as a quality test for local minimize
β¦ LIBER β¦
A global optimality criterion for evolutionary computation
β Scribed by Liu, Jianqin ;Wei, Minjie
- Book ID
- 107507869
- Publisher
- Chinese Electronic Periodical Services
- Year
- 1998
- Tongue
- English
- Weight
- 295 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1005-9784
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An optimality criterion for global quadr
β
Arnold Neumaier
π
Article
π
1992
π
Springer US
π
English
β 350 KB
A fast annealing evolutionary algorithm
β
Wensheng Cai; Xueguang Shao
π
Article
π
2002
π
John Wiley and Sons
π
English
β 136 KB
## Abstract By combining the aspect of population in genetic algorithms (GAs) and the simulated annealing algorithm (SAA), a novel algorithm, called fast annealing evolutionary algorithm (FAEA), is proposed. The algorithm is similar to the annealing evolutionary algorithm (AEA), and a very fast ann
An evolutionary programming algorithm fo
β
Yao Wen Yang; Jian Feng Xu; Chee Kiong Soh
π
Article
π
2006
π
Elsevier Science
π
English
β 687 KB
Multiple response optimization: a global
β
Nuno Ricardo Costa; Zulema Lopes Pereira
π
Article
π
2010
π
John Wiley and Sons
π
English
β 259 KB
π 1 views
A criterion for optimality of design of
β
T.J. Stewart
π
Article
π
1977
π
Elsevier Science
π
English
β 978 KB
A criterion for isolated solution struct
β
Joseph W Jerome
π
Article
π
1986
π
Elsevier Science
π
English
β 455 KB