.png){kind=icon}
.png){kind=icon}
Return
rDSM-A robust Downhill Simplex Method software package for high-dimensional optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.softx.2025.102462.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The Downhill Simplex Method (DSM) is a fast-converging derivative-free optimization technique for nonlinear systems. However, the optimization process is often subject to premature convergence due to degenerate simplices or noise-induced spurious minima. This study introduces a software package for the robust Downhill Simplex Method (rDSM), which incorporates two key enhancements. First, simplex degeneracy is detected and corrected by volume maximization under constraints. Second, the real objective value of noisy problems is estimated by reevaluating the long-standing points. Thus, rDSM improves the convergence of DSM, and may increase the ap plicability of DSM to higher dimensions, even in the presence of noise. The rDSM software package thus provides a robust and efficient solution for both analytical and experimental optimization scenarios. This methodological advancement extends the applicability of simplex-based optimization to complex experimental systems where gradient information remains inaccessible and measurement noise proves non-negligible.
Keywords:
High-dimensional optimization
Downhill simplex method
Degenerate simplex
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.