This work continues the investigation in Ref. : designing minimization algorithms in the framework of supervisor and searcher cooperation (SSC). It explores a wider range of possible supervisors and search engines to be used in the construction of SSC algorithms. Global convergence is established for algorithms with general supervisors and search engines in the absence of noise, and the convergence rate is studied. Both theoretical analysis and numerical results illustrate the appealing attributes of the proposed algorithms.
- supervisor searcher cooperation
- global convergence
- stochastic optimization
- stochastic approximation