Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Numer Algor

Search In Journal Title:

Abbravation: Numerical Algorithms

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1002/aja.1001880304

Search In DOI:

ISSN

1572-9265

Search In ISSN:
Search In Title Of Papers:

Accelerated hybrid conjugate gradient algorithm wi

Authors: Neculai Andrei
Publish Date: 2009/07/25
Volume: 54, Issue: 1, Pages: 23-46
PDF Link

Abstract

An accelerated hybrid conjugate gradient algorithm represents the subject of this paper The parameter β k is computed as a convex combination of beta kHS Hestenes and Stiefel J Res Nat Bur Stand 49409–436 1952 and beta kDY Dai and Yuan SIAM J Optim 10177–182 1999 ie beta kC =left1theta krightbeta kHS + theta k beta kDY The parameter θ k in the convex combinaztion is computed in such a way the direction corresponding to the conjugate gradient algorithm is the best direction we know ie the Newton direction while the pair s k y k satisfies the modified secant condition given by Li et al J Comput Appl Math 202523–539 2007 B k + 1 s k  = z k where z k =y k +lefteta k / left s k right2 rights k eta k =2left f k f k+1 right+left g k +g k+1 rightTs k s k  = x k + 1 − x k and y k  = g k + 1 − g k It is shown that both for uniformly convex functions and for general nonlinear functions the algorithm with strong Wolfe line search is globally convergent The algorithm uses an acceleration scheme modifying the steplength α k for improving the reduction of the function values along the iterations Numerical comparisons with conjugate gradient algorithms show that this hybrid computational scheme outperforms a variant of the hybrid conjugate gradient algorithm given by Andrei Numer Algorithms 47143–156 2008 in which the pair s k y k satisfies the classical secant condition B k + 1 s k  = y k as well as some other conjugate gradient algorithms including HestenesStiefel DaiYuan PolackRibièrePolyak LiuStorey hybrid DaiYuan GilbertNocedal etc A set of 75 unconstrained optimization problems with 10 different dimensions is being used Andrei Adv Model Optim 10147–161 2008


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. Correction of eigenvalues estimated by the Legendre–Gauss Tau method
  2. Design with L-splines
  3. Accelerated Landweber methods based on co-dilated orthogonal polynomials
  4. A small note on the scaling of symmetric positive definite semiseparable matrices
  5. Solitary wave solutions of the one-dimensional Boussinesq equations
  6. Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time
  7. Recursive self preconditioning method based on Schur complement for Toeplitz matrices
  8. A subspace conjugate gradient algorithm for large-scale unconstrained optimization
  9. The sparse cardinal sine decomposition and its application for fast numerical convolution
  10. A family of Steffensen type methods with seventh-order convergence
  11. On linearly related orthogonal polynomials in several variables
  12. Orthogonal polynomials—centroid of their zeroes
  13. Numerical methods for computing sensitivities for ODEs and DDEs
  14. The impact of parameter selection on the performance of an automatic adaptive code for solving reaction–diffusion equations in three dimensions
  15. A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
  16. Extrapolation algorithms for solving nonlinear boundary integral equations by mechanical quadrature methods
  17. A global convergent derivative-free method for solving a system of non-linear equations
  18. A new constrained total variational deblurring model and its fast algorithm
  19. Numerical solution to generalized Lyapunov/Stein and rational Riccati equations in stochastic control
  20. Tracing the Pareto frontier in bi-objective optimization problems by ODE techniques
  21. A study of accelerated Newton methods for multiple polynomial roots
  22. A binary powering Schur algorithm for computing primary matrix roots
  23. Non-uniform exponential tension splines
  24. Nonmonotone line search methods with variable sample size
  25. Galerkin-Chebyshev spectral method and block boundary value methods for two-dimensional semilinear parabolic equations
  26. On approximated ILU and UGS preconditioning methods for linearized discretized steady incompressible Navier-Stokes equations
  27. A marching-on in time meshless kernel based solver for full-wave electromagnetic simulation
  28. Algorithms and software for total variation image reconstruction via first-order methods

Search Result: