Let G be a simple graph of order n and A be its adjacency matrix. Let lambda(1) >= lambda(2) >= ... >= lambda(n) be eigenvalues of matrix A. Then, the energy of a graph G is defined as epsilon(G) = Sigma(n)(i=1) vertical bar lambda(i)vertical bar. In this paper, we will discuss the new lower bounds for the energy of nonsingular graphs in terms of degree sequence, 2-sequence, the first Zagreb index, and chromatic number. Moreover, we improve some previous well-known bounds for connected nonsingular graphs.