Global convergence of a modified spectral conjugate gradient method (Q411054): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
Summary: A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergence is established. Numerical results demonstrate that this algorithm is promising, particularly, compared with the existing similar ones. | |||
Property / review text: Summary: A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergence is established. Numerical results demonstrate that this algorithm is promising, particularly, compared with the existing similar ones. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C52 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021729 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58906306 / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: minpack / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2012/641276 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2005855026 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Acceleration of conjugate gradient algorithms for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A spectral conjugate gradient method for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global convergence of a modified spectral FR conjugate gradient method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global Convergence Properties of Conjugate Gradient Methods for Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A globally convergent version of the Polak-Ribière conjugate gradient method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Numerical Optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The conjugate gradient method in extremal problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4928358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A spectral PRP conjugate gradient methods for nonconvex optimization problem based on modified line search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New spectral PRP conjugate gradient method for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A conjugate gradient method with descent direction for unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5563083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing Unconstrained Optimization Software / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:54, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global convergence of a modified spectral conjugate gradient method |
scientific article |
Statements
Global convergence of a modified spectral conjugate gradient method (English)
0 references
4 April 2012
0 references
Summary: A modified spectral PRP conjugate gradient method is presented for solving unconstrained optimization problems. The constructed search direction is proved to be a sufficiently descent direction of the objective function. With an Armijo-type line search to determinate the step length, a new spectral PRP conjugate algorithm is developed. Under some mild conditions, the theory of global convergence is established. Numerical results demonstrate that this algorithm is promising, particularly, compared with the existing similar ones.
0 references
0 references
0 references
0 references
0 references
0 references
0 references