A new multi-step curve search method for unconstrained minimization problems is proposed. The convergence of the algorithm is proved under some mild conditions...
Keywords: unconstrained optimization, multi-step, curve search method, convergence
11/2004 | Journal of Numerical Mathematics, Walter de GruyterThe paper presents a new class of memory gradient methods with inexact line searches for unconstrained minimization problems...
Keywords: unconstrained optimization, memory gradient method, inexact line search, convergence
04/2005 | Journal of Numerical Mathematics, Walter de Gruyter