A globally convergent version of the Polak-Ribière conjugate gradient method

Mathematical Programming (Impact Factor: 2.09). 78(3):375-391. DOI:10.1007/BF02614362
Source: DBLP

ABSTRACT In this paper we propose a new line search algorithm that ensures global convergence of the Polak-Ribière conjugate gradient
method for the unconstrained minimization of nonconvex differentiable functions. In particular, we show that with this line
search every limit point produced by the Polak-Ribière iteration is a stationary point of the objective function. Moreover,
we define adaptive rules for the choice of the parameters in a way that the first stationary point along a search direction
can be eventually accepted when the algorithm is converging to a minimum point with positive definite Hessian matrix. Under
strong convexity assumptions, the known global convergence results can be reobtained as a special case. From a computational
point of view, we may expect that an algorithm incorporating the step-size acceptance rules proposed here will retain the
same good features of the Polak-Ribière method, while avoiding pathological situations.

0 0
  • [show abstract] [hide abstract]
    ABSTRACT: The binding studies of Co(III) and Ru(II) polypyridyl complexes with dsDNA were carried out by molecular modeling studies to identify the binding interactions. The 3D structures of the metal complexes [Ru(phen)2ippip]2+ (RP-ippip), [Co(phen)2ippip]3+ (CP-ippip), [Ru(bpy)2ippip]2+ (RB-ippip), and [Co(bpy)2ippip]3+ (CB-ippip), where ippip = 4-(isopropylbenzaldehyde)imidazo[4,5-f][1,10] phenanthroline, phen = 1,10-phenanthroline, and bpy = bypyridine, were simulated using molecular dynamic simulations for stable conformers. The energy-minimized 3D structures of metal complexes were docked to the double-stranded dodecamer 5′-D(*AP * CP * CP * GP * AP * CP * GP * TP * CP * GP * GP * T)-3′. The aromatic ligand, ippip, facilitates the binding of the metal complex with DNA through intercalation. The effect of ancillary ligands, phen and bpy, was investigated. The ancillary ligands were found to be involved in bond formation with the phosphate backbone of nucleotide base pairs in metal complex–DNA docked complex. The significant interactions of metal complexes in the major groove of DNA are the prerequisite features of the metal complexes to be considered as DNA-intercalator. The molecular docking data are well substantiated by the available experimental data. The modeling results should extend knowledge about the nature of binding of these complexes with DNA.
    Medicinal Chemistry Research 11/2013; · 1.61 Impact Factor
  • [show abstract] [hide abstract]
    ABSTRACT: We study the convergence properties of several conjugate gradient methods for nonlinear optimization under the assumptions that the objective function is bounded below and its gradient is Lipschitz continuous. Specifically, we strengthen the existing convergence result of the Polak–Ribière–Polyak method with constant stepsizes. For the method of shortest residuals, we establish global convergence of both the Fletcher–Reeves version and the Polak–Ribière–Polyak version using constant stepsizes. A numerical example is also presented.
    Optimization Methods & Software. 12/2011; 26(6):895-909.
  • Source
    [show abstract] [hide abstract]
    ABSTRACT: Purpose – The purpose of this paper is to present a novel gradient-based iterative algorithm for the joint diagonalization of a set of real symmetric matrices. The approximate joint diagonalization of a set of matrices is an important tool for solving stochastic linear equations. As an application, reliability analysis of structures by using the stochastic finite element analysis based on the joint diagonalization approach is also introduced in this paper, and it provides useful references to practical engineers. Design/methodology/approach – By starting with a least squares (LS) criterion, the authors obtain a classical nonlinear cost-function and transfer the joint diagonalization problem into a least squares like minimization problem. A gradient method for minimizing such a cost function is derived and tested against other techniques in engineering applications. Findings – A novel approach is presented for joint diagonalization for a set of real symmetric matrices. The new algorithm works on the numerical gradient base, and solves the problem with iterations. Demonstrated by examples, the new algorithm shows the merits of simplicity, effectiveness, and computational efficiency. Originality/value – A novel algorithm for joint diagonalization of real symmetric matrices is presented in this paper. The new algorithm is based on the least squares criterion, and it iteratively searches for the optimal transformation matrix based on the gradient of the cost function, which can be computed in a closed form. Numerical examples show that the new algorithm is efficient and robust. The new algorithm is applied in conjunction with stochastic finite element methods, and very promising results are observed which match very well with the Monte Carlo method, but with higher computational efficiency. The new method is also tested in the context of structural reliability analysis. The reliability index obtained with the joint diagonalization approach is compared with the conventional Hasofer Lind algorithm, and again good agreement is achieved.
    Engineering Computations 02/2012; 29(2):221-244. · 1.21 Impact Factor

Full-text (3 Sources)

Available from
Sep 30, 2013