A new conjugate gradient method for acceleration of gradient descent algorithms (Q6491230): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
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: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descent Property and Global Convergence of a New Search Direction Method for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5496565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An interior point algorithm for convex quadratic programming with strict equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence Properties of the BFGS Algoritm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some modified Yabe–Takano conjugate gradient methods with sufficient descent condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Behavior of the combination of PRP and HZ methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient hybrid conjugate gradient method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coercivity properties and well-posedness in vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limited memory solution of bound constrained convex quadratic problems arising in video games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of conjugate gradients for solving linear systems / 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: A descent hybrid modification of the Polak–Ribière–Polyak conjugate gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient generalized conjugate gradient algorithms. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3313210 / 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: Q5403849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on minimization problems and multistep methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2866707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis of adaptive trust region methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of quasi-Newton equations and quasi-Newton methods for optimization / rank
 
Normal rank

Revision as of 13:31, 3 December 2024

scientific article; zbMATH DE number 7836869
Language Label Description Also known as
English
A new conjugate gradient method for acceleration of gradient descent algorithms
scientific article; zbMATH DE number 7836869

    Statements

    A new conjugate gradient method for acceleration of gradient descent algorithms (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2024
    0 references
    unconstrained optimization
    0 references
    conjugate gradient method
    0 references
    line search
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references