Result: The convergence properties of some new conjugate gradient methods
Title:
The convergence properties of some new conjugate gradient methods
Authors:
Source:
Applied mathematics and computation. 183(2):1341-1350
Publisher Information:
New York, NY: Elsevier, 2006.
Publication Year:
2006
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Analyse mathématique, Mathematical analysis, Calcul des variations et contrôle optimal, Calculus of variations and optimal control, Analyse numérique. Calcul scientifique, Numerical analysis. Scientific computation, Analyse numérique, Numerical analysis, Méthodes numériques en programmation mathématique, optimisation et calcul variationnel, Numerical methods in mathematical programming, optimization and calculus of variations, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Optimisation. Problèmes de recherche, Optimization. Search problems, Mathématiques appliquées, Applied mathematics, Matemáticas aplicadas, Méthode gradient conjugué, Conjugate gradient method, Método gradiente conjugado, Méthode optimisation, Optimization method, Método optimización, Optimisation sans contrainte, Unconstrained optimization, Optimización sin restricción, Problème recherche, Search problem, Problema investigación, Programmation mathématique, Mathematical programming, Programación matemática, Convergence globale, Optimisation non linéaire, Recherche ligne, Line search, Conjugate gradient, Exact line search, Global convergence, Inexact line search, Nonlinear optimization
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
College of Mathematics and Information Science, Guangxi University, Guangxi 530004, China
Department of Mathematics Science, Liaocheng University, Liaocheng 252059, China
Department of Mathematics Science, Liaocheng University, Liaocheng 252059, China
ISSN:
0096-3003
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Operational research. Management
Operational research. Management
Accession Number:
edscal.18442284
Database:
PASCAL Archive
Further Information
In this paper, a new conjugate gradient formula β*k is given to compute the search directions for unconstrained optimization problems. General convergence results for the proposed formula with some line searches such as the exact line search, the Wolfe-Powell line search and the Grippo-Lucidi line search are discussed. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. The given formula β*k ≥ 0, and has the similar form with βPRPk. Preliminary numerical results show that the proposed methods are efficient.