On the efficient computation of proximal operators of affine-constrained nonconvex functions

Proximal operators with affine constraints arise in numerous models in nonconvex projection, composite optimization, and structured regularization. However, their efficient computation remains challenging due to the simultaneous presence of affine constraints and nonsmooth, possibly nonconvex objectives. In this work, we develop a unified dual-representability framework for analyzing and computing affine-constrained proximal mappings. Specifically, we introduce a multiplier inclusion formulation that connects the primal affine-constrained proximal problem to an unconstrained convex dual problem. Based on this formulation, we prove that, whenever the associated dual inclusion problem admits a solution, strong duality holds. For convex functions and a broad class of prox-regular nonconvex functions, we establish that dual representability holds under a simple subdifferential sum rule, and further develop a hierarchy of verifiable regularity conditions that guarantee this sum rule. In addition, we analyze the smoothness and strong convexity properties of the dual objective, providing a rigorous foundation that guarantees fast local convergence rates for efficient first- and second-order methods. Numerical experiments demonstrate that the proposed dual reformulation enables the reliable computation of globally optimal solutions for a range of large-scale nonconvex proximal and projection problems using existing convex optimization solvers.