Submodular Function

In mathematics, a function
f:R^k \mapsto R
is supermodular iff
z,z' \in R^k \Longrightarrow
f(z \lor z') + f(z \land z') \geq f(z) + f(z'). Where z \lor z' denotes the component-wise maximum and z \land z' the component-wise minimum of z and z'. If −f is supermodular then f is called submodular, and if the inequality is changed to an equality the function is modular. If f is smooth, supermodularity is equivalent to the condition
\partial ^2 f/\partial z_i \partial z_j \geq 0 for all i \neq j.

 

<< PreviousWord BrowserNext >>
general sherman incident
culture of lebanon
babyshambles
national heart, lung and blood institute
city island
conny plank
queen street, auckland
dave parker (baseball player)
gerudo
kelloggville
open archives initiative protocol for metadata harvesting
hawksbill station
gulistan treaty
belgrano, buenos aires
transparent alumina
golden parachute
ohio republican party
abia state, nigeria
francis william kellogg
fogarty's cove
dan fouts
adamawa state, nigeria
mercury monarch
self archiving
anambra state, nigeria
hugh blumenfeld
austric languages
carly patterson
seoul station
cross river state, nigeria
ford ltd
malvina hoffman
soviet guards
dilly knox
with teeth
methone (moon)
pallene (moon)
georgina evers swindell
lrb
caroline evers swindell
josiah begole
buenaventura bez
bobby bonilla
empire records