<p>We introduce the Douglas–Rachford splitting interior-point method (DRSIP), a novel algorithm that combines operator splitting with second-order approaches to solve conic linear programming problems. Our method originates from the fixed-point mapping derived from the Douglas–Rachford splitting method, which transforms the barrier penalized conic programming problem into a series of nonlinear equations. We apply the Newton-type method with a path-following scheme for acceleration. We prove the global convergence of DRSIP and establish its local quadratic convergence under the strict complementarity condition. Our numerical results showcase the algorithm’s robustness, scalability, and adaptability, positioning DRSIP as a versatile and effective solution for large-scale conic programming challenges.</p>