A framework of conjugate direction methods for symmetric linear systems in optimization (Q2342136): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10957-014-0600-0 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3103937829 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.6043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Solution Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864704 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution of linear systems in the 20th century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Predicting the Behavior of Finite Precision Lanczos and Conjugate Gradient Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3881429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of truncated-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar conjugate gradient algorithm for large-scale unconstrained optimization. I: Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A truncated Newton method with non-monotone line search for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Preconditioning by Limited Memory Quasi-Newton Updating / 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: Lanczos conjugate-gradient method and pseudoinverse computation on indefinite and singular systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assessing a search direction within a truncated Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative computation of negative curvature directions in large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting negative curvature directions in linesearch methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone truncated Newton-Krylov method exploiting negative curvature directions, for large scale unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lanczos and Conjugate Gradient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar conjugate gradient algorithm for large-scale unconstrained optimization. II: Application / rank
 
Normal rank
Property / cites work
 
Property / cites work: On A Class of Limited Memory Preconditioners For Large Scale Linear Systems With Multiple Right-Hand Sides / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning Newton-Krylov methods in nonconvex large scale optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10957-014-0600-0 / rank
 
Normal rank

Latest revision as of 02:21, 18 December 2024

scientific article
Language Label Description Also known as
English
A framework of conjugate direction methods for symmetric linear systems in optimization
scientific article

    Statements

    A framework of conjugate direction methods for symmetric linear systems in optimization (English)
    0 references
    0 references
    11 May 2015
    0 references
    This paper deals with iterative Krylov-based methods for the solution of symmetric linear systems, arising in both numerical analysis and optimization contexts. The author addresses a parameter-dependent class of conjugate gradient (CG)-based methods, which can equivalently reduce to the CG for a suitable choice of the parameters. A general framework of iterative methods is presented, inspired by polarity for quadratic hypersurfaces, and based on the generation of conjugate directions. Some numerical results are included.
    0 references
    Krylov-based methods
    0 references
    conjugate direction methods
    0 references
    conjugacy loss and error analysis
    0 references
    preconditioning
    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

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