Sparsity in higher order methods for unconstrained optimization (Q2885474): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithm 862 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient MATLAB Computations with Sparse and Factored Tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel sparse supports for array intrinsic functions of Fortran 90 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Methods for Sparse Linear Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3740904 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Matrices in MATLAB: Design and Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large-scale unconstrained optimization problems and higher order methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of Chebyshev-Halley type methods in Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187244 / rank
 
Normal rank

Latest revision as of 05:55, 5 July 2024

scientific article
Language Label Description Also known as
English
Sparsity in higher order methods for unconstrained optimization
scientific article

    Statements

    Sparsity in higher order methods for unconstrained optimization (English)
    0 references
    0 references
    0 references
    23 May 2012
    0 references
    Halley's method
    0 references
    Newton's methods
    0 references
    Chebyshev's method: sparse factorization
    0 references
    tensors
    0 references
    0 references
    0 references
    0 references

    Identifiers