A class of accelerated subspace minimization conjugate gradient methods (Q2231338): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-021-01897-w / 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/s10957-021-01897-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3196355701 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new three-term conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated subspace minimization three-term conjugate gradient algorithm for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear conjugate gradient methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems in nonlinear conjugate gradient algorithms for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of conjugate gradient algorithms for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diagonal approximation of the Hessian by finite differences for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Point Step Size Gradient Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Barzilai-Borwein conjugate gradient 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: Modified two-point stepsize gradient methods for unconstrained optimization / 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: Function minimization by conjugate gradients / 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: Methods of conjugate gradients for solving linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace minimization conjugate gradient method based on conic model for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient gradient method with approximate optimal stepsize for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563083 / 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: Q4221476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subspace conjugate gradient algorithm for large-scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Subspace Study on Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified BFGS Algorithm for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4589030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-021-01897-W / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:31, 17 December 2024

scientific article
Language Label Description Also known as
English
A class of accelerated subspace minimization conjugate gradient methods
scientific article

    Statements

    A class of accelerated subspace minimization conjugate gradient methods (English)
    0 references
    0 references
    29 September 2021
    0 references
    conjugate gradient method
    0 references
    regularization model
    0 references
    Barzilai-Borwein method
    0 references
    subspace minimization
    0 references
    acceleration method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers