Pages that link to "Item:Q3690096"

The following pages link to Estimation of sparse hessian matrices and graph coloring problems (Q3690096):

Displaying 49 items.

• A polyhedral investigation of star colorings (Q284838) (← links)
• Acyclic colorings of graphs with bounded degree (Q310229) (← links)
• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
• Inexact trust region PGC method for large sparse unconstrained optimization (Q429517) (← links)
• Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
• Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
• \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
• Acyclic and star colorings of cographs (Q643025) (← links)
• Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
• Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
• \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
• Matrix-free preconditioning using partial matrix estimation (Q855287) (← links)
• Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization (Q858748) (← links)
• On the convergence of partitioning group correction algorithms (Q876605) (← links)
• Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
• The complexity of nonrepetitive coloring (Q1003751) (← links)
• Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
• Recent developments in constrained optimization (Q1112728) (← links)
• A chordal preconditioner for large-scale optimization (Q1262220) (← links)
• Successive element correction algorithms for sparse unconstrained optimization (Q1321350) (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
• Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
• Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
• An efficient algorithm for sparse null space basis problem using ABS methods (Q1944750) (← links)
• Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← links)
• Acyclic edge coloring of planar graphs without cycles of specific lengths (Q2251751) (← links)
• Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
• Graph coloring in the estimation of sparse derivative matrices: Instances and applications (Q2467363) (← links)
• The substitution secant/finite difference method for large scale sparse unconstrained optimization (Q2508054) (← links)
• Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation (Q2815431) (← links)
• Optimal direct determination of sparse Jacobian matrices (Q2867431) (← links)
• Coloring Jacobians revisited: a new algorithm for star and~acyclic bicoloring (Q2885476) (← links)
• The independent set perturbation adjoint method: A new method of differentiating mesh-based fluids models (Q3011096) (← links)
• (Q3057247) (← links)
• The Null Space Problem II. Algorithms (Q3783422) (← links)
• A note on direct methods for approximations of sparse Hessian matrices (Q3806696) (← links)
• Computing a sparse Jacobian matrix by rows and columns (Q4227925) (← links)
• Pattern graph for sparse Hessian matrix determination (Q4685608) (← links)
• The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices (Q4720697) (← links)
• AN INITIAL STUDY OF THE FLOW AROUND AN AEROFOIL AT HIGH REYNOLDS NUMBERS USING CONTINUATION (Q4907066) (← links)
• ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS (Q5010149) (← links)
• On star coloring of modular product of graphs (Q5083496) (← links)
• On star coloring of degree splitting of join graphs (Q5142124) (← links)
• A Local Lemma for Focused Stochastic Algorithms (Q5242924) (← links)
• Trust-region interior-point method for large sparse<i>l</i>₁optimization (Q5437524) (← links)
• A polyhedral study of the acyclic coloring problem (Q5891089) (← links)
• A polyhedral study of the acyclic coloring problem (Q5916097) (← links)
• Star chromatic number of some graph products (Q6059104) (← links)