A Linear Constrained Optimization Benchmark For Probabilistic Search Algorithms: The Rotated Klee-Minty Problem

The development, assessment, and comparison of randomized search algorithms heavily rely on benchmarking. Regarding the domain of constrained optimization, the small number of currently available benchmark environments bears no relation to the vast number of distinct problem features. The present paper advances a proposal of a scalable linear constrained optimization problem that is suitable for benchmarking Evolutionary Algorithms. By comparing two recent Evolutionary Algorithm variants, the linear benchmarking environment is demonstrated.

[1]  Hans-Georg Beyer,et al.  A Covariance Matrix Self-Adaptation Evolution Strategy for Linear Constrained Optimization , 2018, ArXiv.

[2]  David S. Johnson,et al.  A theoretician's guide to the experimental analysis of algorithms , 1999, Data Structures, Near Neighbor Searches, and Methodology.

[3]  Andrew M. Sutton,et al.  Differential evolution and non-separability: using selective pressure to focus search , 2007, GECCO '07.

[4]  Radka Polakova,et al.  L-SHADE with competing strategies applied to constrained optimization , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).

[5]  Michael H. Goldwasser,et al.  Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth DIMACS Implementation Challenges, Proceedings of a DIMACS Workshop, USA, 1999 , 2002, Data Structures, Near Neighbor Searches, and Methodology.

[6]  Stefan M. Wild,et al.  Benchmarking Derivative-Free Optimization Algorithms , 2009, SIAM J. Optim..

[7]  Jing J. Liang,et al.  Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on Real-Parameter Optimization , 2005 .

[8]  David H. Wolpert,et al.  No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..

[9]  Tamás Terlaky,et al.  The central path visits all the vertices of the Klee–Minty cube , 2006, Optim. Methods Softw..

[10]  Tamás Terlaky,et al.  How good are interior point methods? Klee–Minty cubes tighten iteration-complexity bounds , 2008, Math. Program..

[11]  P. Suganthan,et al.  Problem Definitions and Evaluation Criteria for the CEC 2010 Competition on Constrained Real- Parameter Optimization , 2010 .

[12]  Hans-Georg Beyer,et al.  A Matrix Adaptation Evolution Strategy for Constrained Real-Parameter Optimization , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[13]  Nimrod Megiddo,et al.  Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..

[14]  Hans-Georg Beyer,et al.  A Covariance Matrix Self-Adaptation Evolution Strategy for Optimization Under Linear Constraints , 2018, IEEE Transactions on Evolutionary Computation.

[15]  Jing J. Liang,et al.  Problem Deflnitions and Evaluation Criteria for the CEC 2006 Special Session on Constrained Real-Parameter Optimization , 2006 .

[16]  Anne Auger,et al.  COCO: Performance Assessment , 2016, ArXiv.

[17]  Carlos A. Coello Coello,et al.  What Makes a Constrained Problem Difficult to Solve by an Evolutionary Algorithm , 2004 .

[18]  Hans-Georg Beyer,et al.  Benchmarking evolutionary algorithms for single objective real-valued constrained optimization - A critical review , 2018, Swarm Evol. Comput..

[19]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .