Motivated and inspired by the discretization of the nonsmooth system of a nonlinear oscillator with damping, we propose what we call the inertial-like proximal point algorithms for finding the null point of the sum of two maximal operators, which has many applied backgrounds, such as, convex optimization and variational inequality problems, compressed sensing etc.. The common feature of the presented algorithms is using the new inertial-like proximal point method which does not involve the computation for the norm of the difference between two adjacent iterates x n and x n−1 in advance, and avoids complex inertial parameters satisfying the traditional and difficult checking conditions. Numerical experiments are presented to illustrate the performances of the algorithms.