Global convergence of a nonlinear conjugate gradient method (Q410397): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(7 intermediate revisions by 7 users not shown) | |||
Property / review text | |||
Summary: A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed. The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search. By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex minimization. Numerical results show that the proposed method is effective and promising by comparing with the VPRP, CG-DESCENT, and DL\(^{+}\) methods. | |||
Property / review text: Summary: A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed. The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search. By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex minimization. Numerical results show that the proposed method is effective and promising by comparing with the VPRP, CG-DESCENT, and DL\(^{+}\) methods. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C52 / 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: 65J15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6021095 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58693086 / 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: Publication / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2011/463087 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047274706 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5563083 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: New conjugacy conditions and related nonlinear conjugate gradient methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5479892 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3313210 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence Properties of Algorithms for Nonlinear Optimization / 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 descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence / 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: A globally convergent version of the Polak-Ribière conjugate gradient method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A descent nonlinear conjugate gradient method for large-scale unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Notes on the Dai-Yuan-Yuan modified spectral gradient method / 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 a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4103338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Testing Unconstrained Optimization Software / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Benchmarking optimization software with performance profiles. / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:42, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Global convergence of a nonlinear conjugate gradient method |
scientific article |
Statements
Global convergence of a nonlinear conjugate gradient method (English)
0 references
3 April 2012
0 references
Summary: A modified PRP nonlinear conjugate gradient method to solve unconstrained optimization problems is proposed. The important property of the proposed method is that the sufficient descent property is guaranteed independent of any line search. By the use of the Wolfe line search, the global convergence of the proposed method is established for nonconvex minimization. Numerical results show that the proposed method is effective and promising by comparing with the VPRP, CG-DESCENT, and DL\(^{+}\) methods.
0 references
0 references
0 references
0 references
0 references
0 references