On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-013-9767-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037586972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of high-order directions for unconstrained optimization inspired by Chebyshev and Shamanskii methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Historical developments in convergence analysis for Newton's and Newton-like methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5825218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Halley class of methods for unconstrainedoptimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-order Newton-penalty algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation issues for high-order algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Kantorovich Theorem for Newton's Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: An acceleration of Newton's method: Super-Halley method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of sparse hessian matrices and graph coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5180766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743963 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient computation of gradients and Jacobians by dynamic exploitation of sparsity in automatic differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Gradients in Large-Scale Optimization Using Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing sparse Hessians with automatic differentiation / 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: Q3539529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bibliography on semiseparable matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of partial separability on large-scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: CUTE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverses of Matrices $\{a_{ij}\}$ which Satisfy $a_{ij} = 0$ for $j > i+p$. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the inverse of band matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5734756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Position, Rotation and Scale Invariant Pattern Classification / 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: Symmetric decmposition of positive definite band matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4777947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity in higher order methods for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Chebyshev-Shamanskii method for solving systems of nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3474197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3528785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060241 / rank
 
Normal rank

Latest revision as of 22:44, 8 July 2024

scientific article
Language Label Description Also known as
English
On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians
scientific article

    Statements

    On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (English)
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    optimization
    0 references
    high order Chebyshev methods
    0 references
    sparse functions
    0 references
    banded Hessians
    0 references
    algorithm complexity
    0 references
    automatic differentiation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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