Estimation of sparse hessian matrices and graph coloring problems

DOI10.1007/BF02612334zbMath0572.65029OpenAlexW2171679443MaRDI QIDQ3690096

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02612334

zbMATH Keywords

numerical examples graph coloring NP-complete problems unconstrained minimization differentiation sparsity estimation of Hessian matrices numerical differences

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical differentiation (65D25) Coloring of graphs and hypergraphs (05C15)

Related Items

Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring, A polyhedral investigation of star colorings, Acyclic colorings of graphs with bounded degree, Matrix-free preconditioning using partial matrix estimation, A note on direct methods for approximations of sparse Hessian matrices, Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, Recent developments in constrained optimization, On star coloring of modular product of graphs, On the convergence of partitioning group correction algorithms, Substitution secant/finite difference method to large sparse minimax problems, Acyclic coloring of graphs without bichromatic long path, Acyclic edge coloring of graphs with large girths, Star chromatic number of some graph products, On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians, On structural parameterizations of star coloring, Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation, Unnamed Item, An efficient algorithm for sparse null space basis problem using ABS methods, \(k\)-forested coloring of planar graphs with large girth, Inexact trust region PGC method for large sparse unconstrained optimization, The Null Space Problem II. Algorithms, Acyclic and star colorings of cographs, Approximating Hessians in unconstrained optimization arising from discretized problems, Acyclic edge coloring of planar graphs with girth at least 5, On star coloring of degree splitting of join graphs, Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs, Graph coloring in the estimation of sparse derivative matrices: Instances and applications, The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models, AN INITIAL STUDY OF THE FLOW AROUND AN AEROFOIL AT HIGH REYNOLDS NUMBERS USING CONTINUATION, Acyclic edge coloring of planar graphs without cycles of specific lengths, Improved bounds for acyclic chromatic index of planar graphs, A polyhedral study of the acyclic coloring problem, Acyclic improper colouring of graphs with maximum degree 4, Trust-region interior-point method for large sparsel₁optimization, Graph theory (algorithmic, algebraic, and metric problems), Pattern graph for sparse Hessian matrix determination, A polyhedral study of the acyclic coloring problem, The substitution secant/finite difference method for large scale sparse unconstrained optimization, The complexity of nonrepetitive coloring, A chordal preconditioner for large-scale optimization, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices, \(k\)-forested choosability of planar graphs and sparse graphs, Acyclic edge coloring of planar graphs with large girth, A Local Lemma for Focused Stochastic Algorithms, ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS, Computing a sparse Jacobian matrix by rows and columns, Variable metric methods for unconstrained optimization and nonlinear least squares, Optimal direct determination of sparse Jacobian matrices, Successive element correction algorithms for sparse unconstrained optimization

Cites Work