Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization (Q6110199): Difference between revisions

Latest revision as of 19:32, 30 December 2024

scientific article; zbMATH DE number 7707385

Language	Label	Description	Also known as
English	Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization	scientific article; zbMATH DE number 7707385

Statements

instance of

scholarly article

0 references

title

Modified globally convergent Polak-Ribière-Polyak conjugate gradient methods with self-correcting property for large-scale unconstrained optimization (English)

0 references

0 references

0 references

4 July 2023

0 references

zbMATH Keywords

conjugate gradient method

0 references

self-correcting property

0 references

sufficient descent condition

0 references

global convergence

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s11075-022-01440-6

0 references

cites work

Q5491447

0 references

A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization

0 references

Q4016506

0 references

Analysis of a self-scaling quasi-Newton method

0 references

Global Convergence Properties of Conjugate Gradient Methods for Optimization

0 references

A self-correcting variable-metric algorithm framework for nonsmooth optimization

0 references

A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs

0 references

The conjugate gradient method in extremal problems

0 references

Methods of conjugate gradients for solving linear systems

0 references

Efficient generalized conjugate gradient algorithms. I: Theory

0 references

Function minimization by conjugate gradients

0 references

A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property

0 references

Q4226179

0 references

Q3313210

0 references

New conjugacy conditions and related nonlinear conjugate gradient methods

0 references

Convergence Conditions for Ascent Methods

0 references

Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search

0 references

Global convergence of the Fletcher-Reeves algorithm with inexact linesearch

0 references

Convergence properties of the Fletcher-Reeves method

0 references

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

0 references

A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search

0 references

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

0 references

An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition

0 references

Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search

0 references

The convergence properties of some new conjugate gradient methods

0 references

An Optimal Extension of the Polak–Ribière–Polyak Conjugate Gradient Method

0 references

A quadratic hybridization of Polak-Ribière-Polyak and Fletcher-Reeves conjugate gradient methods

0 references

A descent family of Dai–Liao conjugate gradient methods

0 references

The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices

0 references

A descent extension of the Polak-Ribière-Polyak conjugate gradient method

0 references

A hybrid conjugate gradient method based on a quadratic relaxation of the Dai–Yuan hybrid conjugate gradient parameter

0 references

A simple three-term conjugate gradient algorithm for unconstrained optimization

0 references

A \(q\)-Polak-Ribière-Polyak conjugate gradient algorithm for unconstrained optimization problems

0 references

On \(q\)-BFGS algorithm for unconstrained optimization problems

0 references

A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems

0 references

Adaptive three-term PRP algorithms without gradient Lipschitz continuity condition for nonconvex functions

0 references

Adaptive scaling damped BFGS method without gradient Lipschitz continuity

0 references

The modified PRP conjugate gradient algorithm under a non-descent line search and its application in the Muskingum model and image restoration problems

0 references

A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations

0 references

Modified spectral PRP conjugate gradient method for solving tensor eigenvalue complementarity problems

0 references

Some three-term conjugate gradient methods with the new direction structure

0 references

A spectral conjugate gradient method for solving large-scale unconstrained optimization

0 references

Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization

0 references

A globally convergent and efficient method for unconstrained discrete-time optimal control

0 references

An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction

0 references

Benchmarking optimization software with performance profiles.

0 references

Q3539529

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S11075-022-01440-6

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6110199

@@ Property / DOI @@
-.1007/s11075-022-01440-6
@@ Property / DOI: 10.1007/s11075-022-01440-6 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S11075-022-01440-6
@@ Property / DOI: 10.1007/S11075-022-01440-6 / rank @@
+Normal rank