A graph theoretic approach to strong monotonicity with respect to polyhedral cones

DOI10.1023/A:1015290601993MaRDI QIDQ1611285zbMATH OpenOpenAlexFDO

Authors H. Kunze, David Siegel

Publication date 21 August 2002

Published in Positivity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1015290601993

zbMATH Keywords

graph theoryconvex conesstrongly monotone floworder preserving flow

Mathematics Subject Classification ID

Monotone flows as dynamical systems (37C65) Monotone systems involving ordinary differential equations (34C12)

Recommendations

• Monophonic convexity in weighted graphs
• Canonical and monophonic convexities in hypergraphs
• scientific article; zbMATH DE number 671854
• On the monotonicity of (k;g,h)-graphs
• Monotonicity of polymatroids
• scientific article; zbMATH DE number 1539545
• A graph theoretical approach to monotonicity with respect to initial conditions II
• Cone monotonicity: structure theorem, properties, and comparisons to other notions of monotonicity
• Notes on graph-convergence for maximal monotone operators
• A monadic second-order definition of the structure of convex hypergraphs.

Cited in

(9)

• Monotonicity with respect to closed convex cones II
• Quadratic optimization over a polyhedral cone
• Canonical and monophonic convexities in hypergraphs
• Graphical methods for analysing feedback in biological networks -- a survey
• On comparison systems for ordinary differential equations
• Monotonicity in chemical reaction systems
• A monadic second-order definition of the structure of convex hypergraphs.
• scientific article; zbMATH DE number 671854 (Why is no real title available?)
• A graph-theoretic condition for irreducibility of a set of cone preserving matrices

This page was built for publication: A graph theoretic approach to strong monotonicity with respect to polyhedral cones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611285)