EconPapers    
Economics at your fingertips  
 

A New Adaptive Conjugate Gradient Algorithm for Large-Scale Unconstrained Optimization

Neculai Andrei ()
Additional contact information
Neculai Andrei: Research Institute for Informatics

A chapter in Optimization and Its Applications in Control and Data Sciences, 2016, pp 1-16 from Springer

Abstract: Abstract An adaptive conjugate gradient algorithm is presented. The search direction is computed as the sum of the negative gradient and a vector determined by minimizing the quadratic approximation of objective function at the current point. Using a special approximation of the inverse Hessian of the objective function, which depends by a positive parameter, we get the search direction which satisfies both the sufficient descent condition and the Dai-Liao’s conjugacy condition. The parameter in the search direction is determined in an adaptive manner by clustering the eigenvalues of the matrix defining it. The global convergence of the algorithm is proved for uniformly convex functions. Using a set of 800 unconstrained optimization test problems we prove that our algorithm is significantly more efficient and more robust than CG-DESCENT algorithm. By solving five applications from the MINPACK-2 test problem collection, with 106 variables, we show that the suggested adaptive conjugate gradient algorithm is top performer versus CG-DESCENT.

Keywords: Unconstrained optimization; Adaptive conjugate gradient method; Sufficient descent condition; Conjugacy condition; Eigenvalues clustering; Numerical comparisons (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (2)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-42056-1_1

Ordering information: This item can be ordered from
http://www.springer.com/9783319420561

DOI: 10.1007/978-3-319-42056-1_1

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-01
Handle: RePEc:spr:spochp:978-3-319-42056-1_1