We consider nonconvex optimization problems in which coordinate-wise type optimality conditions are superior to standard optimality conditions such as stationarity. Among the models that we explore are those based on sparsity-inducing terms. We illustrate that the hierarchy between optimality conditions induces a corresponding hierarchy between various optimization algorithms.