We consider cooperative multi-agent consensus optimization problems over an undirected network of agents, where only local communications are allowed. The objective is to minimize the sum of agent-specific convex functions over agent-specific private conic constraint sets. We provide convergence rates in sub-optimality, infeasibility and consensus violation when the sum function is strongly convex; examine the effect of underlying network topology on the convergence rates of the proposed decentralized algorithm.