<p>The very large scale integration (VLSI) placement problem aims to position electronic cells within a circuit region, optimizing objectives such as wire length and ensuring no cell overlaps. Analytical methods frame the placement problem as a constrained optimization problem and solve its smoothed or relaxed version using optimization methods. In this paper, we shall solve the placement problem without employing any smoothing or relaxation technique. We propose an efficient, smoothing-free analytical method for solving the VLSI placement problem. The basic idea is to utilize the nonsmooth proximal alternating direction method (PADM) to deal with the difficulties associated with the nonsmoothness and constraint complexity of the VLSI placement problem. The global convergence of the method is established. Numerical experiments are conducted on the GSRC circuits, which demonstrate the usefulness of the method.</p>