Optimal direct determination of sparse Jacobian matrices
From MaRDI portal
Publication:2867431
DOI10.1080/10556788.2012.693927zbMath1278.90340OpenAlexW2091021643MaRDI QIDQ2867431
Shahadat Hossain, Trond Steihaug
Publication date: 19 December 2013
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2012.693927
Computational methods for sparse matrices (65F50) Nonlinear programming (90C30) Combinatorial optimization (90C27)
Related Items
Graph models and their efficient implementation for sparse Jacobian matrix determination, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, Pattern graph for sparse Hessian matrix determination
Uses Software
Cites Work
- Unnamed Item
- Generalized descent for global optimization
- Detecting Jacobian sparsity patterns by Bayesian probing
- Another look at graph coloring via propositional satisfiability
- Graph coloring in the estimation of sparse derivative matrices: Instances and applications
- Estimation of Sparse Jacobian Matrices and Graph Coloring Blems
- Estimation of Sparse Jacobian Matrices
- MIQR: A Multilevel Incomplete QR Preconditioner for Large Sparse Least‐Squares Problems
- Evaluating Derivatives
- CsegGraph: a graph colouring instance generator
- Estimation of sparse hessian matrices and graph coloring problems
- On the Estimation of Sparse Hessian Matrices
- New methods to color the vertices of a graph
- Computing a sparse Jacobian matrix by rows and columns
- Computing Large Sparse Jacobian Matrices Using Automatic Differentiation
- Global Continuation for Distance Geometry Problems
- The Efficient Computation of Sparse Jacobian Matrices Using Automatic Differentiation
- Inexact Quasi-Newton methods for sparse systems of nonlinear equations
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- On the Successive Projections Approach to Least-Squares Problems
- Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
