Skip to content
DraconiticResearch
Search Sources API
181,713 studies31 sourcesUpdated 47 min ago
Peer-reviewedCC BY 4.0Mathematics

Stock Exchange Trading Optimization Algorithm Improved Based on Information Technology Investment Analysis for Numerical Optimization and Practical Problems

  1. 1Carey Business School, The Johns Hopkins University, Baltimore, MD 21231, USA
  2. 2State Key Laboratory of Industrial Control Technology, College of Control Science and Engineering, Zhejiang University, Hangzhou 310058, China

Abstract

Stock Exchange Trading Optimization (SETO) is a population-based metaheuristic with a compact market-inspired search framework, but its performance may be limited by uneven random initialization, coarse Relative Strength Index-based search-state identification, and excessive concentration of trading resources. To address these limitations, this study proposes an improved SETO, termed ISETO, by reformulating concepts from information technology investment analysis into population-search mechanisms. First, an IT investment portfolio screening initialization strategy jointly considers solution quality and spatial diversity to improve initial population coverage. Second, a discounted-return and downside-risk dual-state search strategy evaluates the magnitude, temporal relevance, and risk of historical improvements to adaptively coordinate exploration and exploitation. Third, an entropy-regularized real-option capital reallocation strategy redistributes search resources according to solution quality, capital efficiency, technical debt, and population diversity, while reinvesting abandoned candidates into underexplored regions to mitigate stagnation. The dominant computational complexity remains approximately O(TmaxND). ISETO is evaluated on 22 benchmark functions from the IEEE CEC2020 and CEC2022 suites under 10- and 20-dimensional settings and compared with nine representative metaheuristic algorithms. Under the conventional iteration-based setting, ISETO achieves the best or tied-best mean results on all CEC2020 functions at both dimensions, all 12 CEC2022 functions at 10 dimensions, and 11 of the 12 CEC2022 functions at 20 dimensions. Additional experiments under an identical objective-function evaluation budget confirm that these advantages are not simply caused by additional function evaluations. Holm-adjusted statistical tests and Cliff’s delta effect sizes further support the significance and practical magnitude of the observed improvements. Ablation experiments verify that all three proposed mechanisms contribute positively, while parameter sensitivity and population-diversity analyses demonstrate that ISETO is relatively robust to parameter variation and better able to preserve exploration capability during evolution. The additional mechanisms introduce only a moderate runtime overhead relative to the original SETO. ISETO is further applied to a three-dimensional robotic-arm path-planning problem. Over 30 independent runs, it obtains a best objective value of 290.69 and a mean value of 291.91. Its best result is 5.56% lower than the best competing result, while its mean result improves upon the original SETO by approximately 6.02%. These results demonstrate that ISETO provides improved convergence accuracy, robustness, and search diversity while retaining competitive computational efficiency, and has promising potential for constrained engineering optimization.

Related

  1. An Investment Analysis Research Enhanced Enterprise Development Algorithm for Bankruptcy Prediction
    Jinze Li, Chengpeng Li
    MathematicsPeer-reviewedCC BY 4.0General mathematicsCrossref
  2. Enhancing early-stage breakthrough technology identification: A CatBoost model optimized with the SABO algorithm
    Ming Lei, Yin Yu
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsOncologyPLOS
  3. An energy-decreasing algorithm for the finite element approximation of ferronematic equilibrium states and its numerical realization
    Alexandre Ern, Ruma R. Maity
    HALPreprintCC BY-NC-ND 4.0Full textNumerical analysis & scientific computingHALarXiv
  4. An Adaptive Symplectic Proximal Point Algorithm: Faster Convergence and Improved Numerical Performance
    Yi Zhang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. A Low-rank ADI Algorithm for the Numerical Solution of Large Discrete-time Non-symmetric Algebraic Riccati Equations
    Umair Zulfiqar
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
BibTeX
@article{li2026stock,
  title = {{Stock Exchange Trading Optimization Algorithm Improved Based on Information Technology Investment Analysis for Numerical Optimization and Practical Problems}},
  author = {Jinze Li and Chengpeng Li},
  journal = {Mathematics},
  year = {2026},
  month = oct,
  doi = {10.3390/math14203723},
  url = {https://www.mdpi.com/2227-7390/14/20/3723},
  note = {CC BY 4.0},
}
RIS
TY  - JOUR
TI  - Stock Exchange Trading Optimization Algorithm Improved Based on Information Technology Investment Analysis for Numerical Optimization and Practical Problems
AU  - Jinze Li
AU  - Chengpeng Li
PY  - 2026
DA  - 2026/10/13
JO  - Mathematics
DO  - 10.3390/math14203723
UR  - https://www.mdpi.com/2227-7390/14/20/3723
AB  - Stock Exchange Trading Optimization (SETO) is a population-based metaheuristic with a compact market-inspired search framework, but its performance may be limited by uneven random initialization, coarse Relative Strength Index-based search-state identification, and excessive concentration of trading resources. To address these limitations, this study proposes an improved SETO, termed ISETO, by reformulating concepts from information technology investment analysis into population-search mechanisms. First, an IT investment portfolio screening initialization strategy jointly considers solution quality and spatial diversity to improve initial population coverage. Second, a discounted-return and downside-risk dual-state search strategy evaluates the magnitude, temporal relevance, and risk of historical improvements to adaptively coordinate exploration and exploitation. Third, an entropy-regularized real-option capital reallocation strategy redistributes search resources according to solution quality, capital efficiency, technical debt, and population diversity, while reinvesting abandoned candidates into underexplored regions to mitigate stagnation. The dominant computational complexity remains approximately O(TmaxND). ISETO is evaluated on 22 benchmark functions from the IEEE CEC2020 and CEC2022 suites under 10- and 20-dimensional settings and compared with nine representative metaheuristic algorithms. Under the conventional iteration-based setting, ISETO achieves the best or tied-best mean results on all CEC2020 functions at both dimensions, all 12 CEC2022 functions at 10 dimensions, and 11 of the 12 CEC2022 functions at 20 dimensions. Additional experiments under an identical objective-function evaluation budget confirm that these advantages are not simply caused by additional function evaluations. Holm-adjusted statistical tests and Cliff’s delta effect sizes further support the significance and practical magnitude of the observed improvements. Ablation experiments verify that all three proposed mechanisms contribute positively, while parameter sensitivity and population-diversity analyses demonstrate that ISETO is relatively robust to parameter variation and better able to preserve exploration capability during evolution. The additional mechanisms introduce only a moderate runtime overhead relative to the original SETO. ISETO is further applied to a three-dimensional robotic-arm path-planning problem. Over 30 independent runs, it obtains a best objective value of 290.69 and a mean value of 291.91. Its best result is 5.56% lower than the best competing result, while its mean result improves upon the original SETO by approximately 6.02%. These results demonstrate that ISETO provides improved convergence accuracy, robustness, and search diversity while retaining competitive computational efficiency, and has promising potential for constrained engineering optimization.
SN  - 2227-7390
ER  -