Abstract
The Kiefer-Wolfowitz algorithm (1952) for function minimisation under arbitrary deterministic disturbances is studied and necessary and sufficient conditions on the noise sequence are obtained for convergence of the algorithm. We use a notion of persistently disturbing noise sequences, and show that this characterizes convergence of the algorithm under each fixed noise sequence. The results obtained are stronger than previous results and the proof techniques are simpler, involving only basic notions of convergence.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
