Globalized and bounded Nelder‐Mead algorithm with deterministic restarts for tuning controller parameters: Method and application
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Summary This paper develops and examines an optimization algorithm for simulation‐based tuning of controller parameters. The proposed algorithm globalizes the Guin augmented variant of Nelder–Mead's nonlinear downhill simplex by deterministic restarts, linearly growing memory vector, and moving initial simplex. First, the effectiveness of the algorithm is tested using 10 complex and multimodal optimization benchmarks. The algorithm achieves global minima of all benchmarks and compares favorably against the evolutionary, swarm, and other globalized local‐search multimodal optimization algorithms in probability of finding global minimum and numerical cost. Next, the proposed algorithm is applied for tuning sliding mode controller parameters for a servo pneumatic position control application. The experimental results reveal that the system with sliding mode controller parameters tuned using the proposed algorithm targeting smooth position control with maximum possible accuracy, performs as desired and eliminates the need of manual online tuning for desired performance. The results are also compared with the performance of the same servo pneumatic system with parameters tuned using manual online tuning in an earlier published work. The system with controller parameters tuned using the proposed algorithm shows improvement in accuracy by 28.9% in sinusoidal and 42.2% in multiple step polynomials tracking.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it