A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (Q6086842): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Hestenes–Stiefel conjugate gradient method with an optimal property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fitting of Power Series, Meaning Polynomials, Illustrated on Band-Spectroscopic Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression / 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: 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: An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition / 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: 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: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient descent Dai-Yuan type nonlinear conjugate gradient method for unconstrained optimization problems / 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: Q3967358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive restart for accelerated gradient schemes / 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: A Newton-CG algorithm with complexity guarantees for smooth unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2975072 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New nonlinear conjugate gradient formulas for large-scale unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations / 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

Revision as of 12:49, 3 August 2024

scientific article; zbMATH DE number 7763841
Language Label Description Also known as
English
A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem
scientific article; zbMATH DE number 7763841

    Statements

    A truncated three-term conjugate gradient method with complexity guarantees with applications to nonconvex regression problem (English)
    0 references
    10 November 2023
    0 references
    sufficient descent
    0 references
    global convergence
    0 references
    complexity guarantees
    0 references
    Wolfe line search
    0 references
    Armijo line search
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers