Pages that link to "Item:Q2885474"
From MaRDI portal
The following pages link to Sparsity in higher order methods for unconstrained optimization (Q2885474):
Displaying 10 items.
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method (Q432797) (← links)
- Successive element correction algorithms for sparse unconstrained optimization (Q1321350) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- On the Halley class of methods for unconstrainedoptimization problems (Q3161140) (← links)
- On large-scale unconstrained optimization problems and higher order methods (Q3562406) (← links)
- High Performance Rearrangement and Multiplication Routines for Sparse Tensor Arithmetic (Q4610135) (← links)
- Higher-order reverse automatic differentiation with emphasis on the third-order (Q5962714) (← links)
- On the final steps of Newton and higher order methods (Q5963239) (← links)
