---
title: RoTO Benchmark for Constrained Optimization
url: https://www.emergentmind.com/topics/roto-benchmark
type: topic
---

# RoTO Benchmark for Constrained Optimization

The RoTO Benchmark is a suite of linear constrained optimization problems specifically constructed to evaluate and stress-test the robustness, scalability, and invariance properties of randomized search algorithms, particularly evolutionary algorithms (EAs), in the domain of constrained optimization. Its foundation is a geometric transformation of the classical Klee–Minty problem, designed to eliminate coordinate-alignment biases and introduce coupling among decision variables, thereby creating challenging, reproducible scenarios for black-box optimization methods [1807.10068].

## 1. Foundational Problem: The Klee–Minty Linear Program

The original Klee–Minty LP is a perturbed $n$-dimensional unit-cube problem with an objective and constraint structure notorious for exposing the exponential worst-case complexity of the simplex algorithm. The problem is formalized as:
\[
\min_{x\in\mathbb{R}^n}\;c^T x
\quad\text{s.t.}\quad A\,x\le b,
\]
where $c \in\mathbb{R}^n$ is $(0,\dots,0,1)^T$, matrix $A\in\mathbb{R}^{2n\times n}$ combines identity and lower-triangular parts with perturbation parameter $\varepsilon=0.1$, and $b\in\mathbb{R}^{2n}$ encodes upper and lower bounds for each variable via $A_1$ (upper) and $A_2$ (lower) blocks. The unique optimum lies at $x^*=(0, \ldots, 0)^T$. This construction yields a highly axis-aligned, separable feasible region [1807.10068].

## 2. The RoTO Transformation: Rotation and Translation

To eradicate coordinate-system biases and disallow simple coordinate-wise search strategies from exploiting separability, the RoTO benchmark applies a rigid isometry (rotation plus translation) to the Klee–Minty polytope. The transformation is defined as:
\[
T(y)\;=\;\tilde y \;=\;R\,(y - t),
\]
where $R\in\mathbb{R}^{n\times n}$ is an orthogonal rotation matrix (in the 2-plane spanned by $v_1 = e_n$ and $v_2$, with angle $\varrho = 350^\circ$), and $t=(n^3, \dots, n^3)^T$ translates the optimum deep into the interior. The resulting rotated problem formulation is:
\[
\min_{y\in\mathbb{R}^n}\;c^Ty
\quad\text{s.t.}\quad
A\,R\,(y-t)\le b,
\quad
0\le y\le 5\,n^3,
\]
with the unique minimum at $y^*=t,\,f_{\rm opt}=n^3$ [1807.10068].

## 3. Benchmark Generation and Scalability

The RoTO benchmark suite is scalable in $n$ and parametrized by rotation matrix $R$ and translation $t$. Instances are generated by choosing $n$ from a standard set (e.g., $\{2,3,5,10,20,40\}$), fixing $\varepsilon$ and $t$, and applying the specified rotation. Additional diversity is achieved by altering $\varrho$ or randomizing $R$, while preserving hardness through the inherited worst-case properties of the Klee–Minty form. For each dimension, at least 15 independent problem instances are typically sampled for robust comparison [1807.10068].

## 4. Performance Metrics and Evaluation Protocol

Evaluation under the RoTO benchmark adheres to protocols emphasizing black-box optimization and fairness. One function evaluation comprises the computation of both objective $f(y)$ and the full constraint vector $A\,R\,(y-t)$. The standard evaluation budget is $2\times 10^4 n$ function evaluations per run.

Termination conditions are:
- $f(y)\le f_{\rm opt}+10^{-8}$
- No improvement for $100n$ evaluations
- Exhaustion of budget

Constraint violation is quantified as:
\[
\nu(y)=\sum_{i=1}^{2n}\max\{0, (A\,R\,(y-t)-b)_i\},
\]
and solutions are lexicographically ordered:
\[
y\preceq_{\rm lex} z \Longleftrightarrow (\nu(y)<\nu(z)) \vee (\nu(y)=\nu(z) \wedge f(y)\le f(z))
\]
Summary metrics include: best-ever objective $f_{\rm best}$, median objective and violation $(f_{\rm med},\nu_{\rm med})$, $|f_{\rm med}-f_{\rm opt}|$, feasibility rate ($\mathrm{FR}$), mean objective-space distance to $y^*$, and mean evaluations to termination. Results are customarily visualized via ECDF plots over achievement of a suite of target values, extending analytic transparency [1807.10068].

## 5. Empirical Results and Algorithmic Insights

The RoTO benchmark differentiates optimizers based on their invariance to rotation, constraint-handling, and global search capacity. In comparative studies, $\epsilon$MAg-ES and LSHADE44 (state-of-the-art EAs) achieved $f_{\rm opt}$ to within $10^{-8}$ for $n$ up to 40 with $\mathrm{FR}=1.0$. $\epsilon$MAg-ES required fewer evaluations (e.g., $3.4\times 10^5$ for $n=40$) than LSHADE44 ($5.7\times 10^5$), while random search was consistently ineffective. LP solvers (e.g., glpk) reached similar optimal values, but with larger numerical errors in $y^*$. ECDFs demonstrated that $\epsilon$MAg-ES exhibits a superior early-time performance profile, increasing with problem dimension [1807.10068].

## 6. Algorithmic Implications and Best Practices

By eliminating axis-alignment and introducing enforced coupling, the RoTO benchmark invalidates coordinate-based and separable search heuristics, challenging algorithms to adapt via rotationally-invariant sampling or adaptive covariance. Practical recommendations include initializing uniformly on $[0,5n^3]^n$, employing lexicographic tie-breakers, and reporting the full complement of metrics and ECDFs. The RoTO construction enables modular instance generation for large-scale benchmarking, offering a reproducible platform for testing global search and rotational invariance across linear constraint landscapes [1807.10068].

## 7. Significance in Evolutionary Algorithm Research

The RoTO benchmark substantially addresses a critical gap in constrained optimization benchmarking by presenting stringent, scalable, and reproducible test cases that reflect real-world geometric ambiguity and variable coupling. Its design ensures avoidance of the “coordinate-bias trap,” allowing robust comparative evaluation of stochastic optimizers under rotation and translation. RoTO thus serves as a focal environment for developing and calibrating covariance-adapting, invariance-respecting, and constraint-resilient search methodologies, and remains a recommended baseline for experimental studies in evolutionary computation [1807.10068].

Source: https://www.emergentmind.com/topics/roto-benchmark