Novel Algorithms for Noisy Minimization Problems with Applications to Neural Networks Training

K. Sirlantzis, John Douglas Lamb, W. B. Liu

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


The supervisor and searcher cooperation framework (SSC), introduced in Refs. 1 and 2, provides an effective way to design efficient optimization algorithms combining the desirable features of the two existing ones. This work aims to develop efficient algorithms for a wide range of noisy optimization problems including those posed by feedforward neural networks training. It introduces two basic SSC algorithms. The first seems suited for generic problems. The second is motivated by neural networks training problems. It introduces also inexact variants of the two algorithms, which seem to possess desirable properties. It establishes general theoretical results about the convergence and speed of SSC algorithms and illustrates their appealing attributes through numerical tests on deterministic, stochastic, and neural networks training problems.

Original languageEnglish
Pages (from-to)325-340
Number of pages15
JournalJournal of Optimization Theory and Applications
Issue number2
Publication statusPublished - May 2006


  • nonlinear programming
  • stochastic programming
  • noisy optimization
  • neural networks training

Cite this