A self-adjusting spectral conjugate gradient method for large-scale unconstrained optimization (Q370232): Difference between revisions

Summary: This paper presents a hybrid spectral conjugate gradient method for large-scale unconstrained optimization, which possesses a self-adjusting property. Under the standard Wolfe conditions, its global convergence result is established. Preliminary numerical results are reported on a set of large-scale problems in CUTEr to show the convergence and efficiency of the proposed method.

0 references

zbMATH Keywords

self-adjusting property

0 references

Wolfe conditions

0 references

describes a project that uses

CUTEr

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1155/2013/814912

0 references

cites work

An efficient hybrid conjugate gradient method for unconstrained optimization

0 references

A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property

0 references

Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems

0 references

A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search

0 references

A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence

0 references

Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems

0 references

Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization

0 references

New conjugacy condition and related new conjugate gradient methods for unconstrained optimization

0 references

New properties of a nonlinear conjugate gradient method

0 references

Global Convergence Properties of Conjugate Gradient Methods for Optimization

0 references

Benchmarking optimization software with performance profiles.

0 references

Identifiers

zbMATH Open document ID

1278.90389

0 references

DOI

10.1155/2013/814912

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:370232

@@ Property / review text @@
+Summary: This paper presents a hybrid spectral conjugate gradient method for large-scale unconstrained optimization, which possesses a self-adjusting property. Under the standard Wolfe conditions, its global convergence result is established. Preliminary numerical results are reported on a set of large-scale problems in CUTEr to show the convergence and efficiency of the proposed method.
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C30
@@ Property / Mathematics Subject Classification ID: 90C30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6209455
@@ Property / zbMATH DE Number: 6209455 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+self-adjusting property
@@ Property / zbMATH Keywords: self-adjusting property / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Wolfe conditions
@@ Property / zbMATH Keywords: Wolfe conditions / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q58917527
@@ Property / Wikidata QID: Q58917527 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+CUTEr
@@ Property / describes a project that uses: CUTEr / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1155/2013/814912
+Normal rank
@@ Property / OpenAlex ID @@
+W2053031072
@@ Property / OpenAlex ID: W2053031072 / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient hybrid conjugate gradient method for unconstrained optimization
+Normal rank
@@ Property / cites work @@
+A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
+Normal rank
@@ 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
+Normal rank
@@ Property / cites work @@
+A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
+Normal rank
@@ Property / cites work @@
+A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
+Normal rank
@@ Property / cites work @@
+Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
+Normal rank
@@ Property / cites work @@
+Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
+Normal rank
@@ Property / cites work @@
+New conjugacy condition and related new conjugate gradient methods for unconstrained optimization
+Normal rank
@@ Property / cites work @@
+New properties of a nonlinear conjugate gradient method
+Normal rank
@@ Property / cites work @@
+Global Convergence Properties of Conjugate Gradient Methods for Optimization
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:370232