On efficient Hessian computation using the edge pushing algorithm in Julia (Q4685595): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Livarh / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Livarhacc / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AMPL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Julia / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JuMP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2891583213 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q121664066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trust Region Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3125551 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: ColPack / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new framework for the computation of Hessians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the sparsity pattern of Hessians using automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence analysis for partitioned quasi-Newton updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioned variable metric updates for large structured optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation / rank
 
Normal rank

Latest revision as of 18:50, 16 July 2024

scientific article; zbMATH DE number 6949121
Language Label Description Also known as
English
On efficient Hessian computation using the edge pushing algorithm in Julia
scientific article; zbMATH DE number 6949121

    Statements

    On efficient Hessian computation using the edge pushing algorithm in Julia (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 October 2018
    0 references
    automatic differentiation
    0 references
    sparse Hessian computation
    0 references
    edge pushing
    0 references
    algebraic modelling language
    0 references
    Julia
    0 references
    JuMP
    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