Non monotone algorithms for unconstrained minimization: Upper bounds on function values

Abstract

Non monotone algorithms allow a possible increase of function values at certain iterations. This paper gives a suitable control on this increase to preserve the convergence properties of its monotone counterpart. A new efficient MultiLineal Search is also proposed for minimization algorithms. © 2006 International Federation for Information Processing.