Method to change value in a key for a min heap
Find the key's node
Change the node's key to the new key
Heapify the node


This will work in $O(log(n))$ worst case. 

If the old key is the new key the node wont move. You can also explicitly check it before searching for the node, if you prefer.