An Accelerated Double Step Size model in unconstrained optimization

This work presents a double step size algorithm with accelerated property for solving nonlinear unconstrained optimization problems. Using the inexact line search technique, as well as the approximation of the Hessian by an adequate diagonal matrix, an efficient accelerated gradient descent method i...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematics and computation 2015-01, Vol.250, p.309-319
Main Author: Petrovic, Milena J
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Central processing units
Convergence rate
Gradient descent methods
Iterative methods
Line search
Mathematical analysis
Mathematical models
Newton method
Nonlinearity
Optimization
Searching
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This work presents a double step size algorithm with accelerated property for solving nonlinear unconstrained optimization problems. Using the inexact line search technique, as well as the approximation of the Hessian by an adequate diagonal matrix, an efficient accelerated gradient descent method is developed. The proposed method is proven to be linearly convergent for uniformly convex functions and also, under some specific conditions, linearly convergent for strictly convex quadratic functions. Numerical testings and comparisons show that constructed scheme exceeds some known iterations for unconstrained optimization with respect to all three tested properties: number of iterations, CPU time and number of function evaluations.
ISSN:0096-3003
1873-5649
DOI:10.1016/j.amc.2014.10.104