A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (Q2515066): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SifDec / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CG_DESCENT / 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.1007/s10589-014-9662-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067693696 / 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: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Two-Term PRP-Based Descent Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe 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: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5702604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Function minimization by conjugate gradients / 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: CUTEr and SifDec / 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: Q5479892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 851 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Limited Memory Conjugate Gradient Method / 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: Efficient generalized conjugate gradient algorithms. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Three-Term Conjugate Gradient Method with Sufficient Descent Property for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of some conjugate direction procedures for function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of modified Polak-Ribière-Polyak conjugate gradient methods with sufficient descent property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Liu-Storey type nonlinear conjugate gradient method for unconstrained 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: Some descent three-term conjugate gradient methods and their global convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4103338 / rank
 
Normal rank

Latest revision as of 16:08, 9 July 2024

scientific article
Language Label Description Also known as
English
A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
scientific article

    Statements

    A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2015
    0 references
    unconstrained optimization
    0 references
    three-term conjugate gradient method
    0 references
    sufficient descent condition
    0 references
    global convergence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers