Accelerated multiple step-size methods for solving unconstrained optimization problems. (3rd September 2021)

• Record Type: Journal Article
• Authors: Ivanov, Branislav; Stanimirović, Predrag S.; Milovanović, Gradimir V.; Djordjević, Snežana; Brajević, Ivona
• Is Part Of: Optimization methods and software. Volume 36:Number 5(2021)
• Page Start: 998
• Page End: 1029
• Publication Date: 2021-09-03
• Subjects: Unconstrained optimization -- gradient-descent methods -- convergence -- line search; 65K05 -- 90C30; Mathematical optimization -- Periodicals; Algorithms -- Periodicals; 519.7
• DOI: 10.1080/10556788.2019.1653868
• Languages: English
• ISSNs: 1055-6788

Abstract

ABSTRACT: Two transformations of gradient-descent iterative methods for solving unconstrained optimization are proposed. The first transformation is called modification and it is defined using a small enlargement of the step size in various gradient-descent methods. The second transformation is termed as hybridization and it is defined as a composition of gradient-descent methods with the Picard–Mann hybrid iterative process. As a result, several accelerated gradient-descent methods for solving unconstrained optimization problems are presented, investigated theoretically and numerically compared. The proposed methods are globally convergent for uniformly convex functions satisfying certain condition under the assumption that the step size is determined by the backtracking line search. In addition, the convergence on strictly convex quadratic functions is discussed. Numerical comparisons show better behaviour of the proposed methods with respect to some existing methods in view of the Dolan and Moré's performance profile with respect to all analysed characteristics: number of iterations, the CPU time, and the number of function evaluations.