Skip to content
Preprint

A switching proximal gradient method for constrained difference-of-convex optimization problems

Oct 2026 · 0 citations · 40 references
Mathematics

Abstract

We study difference-of-convex optimization problems with several composite inequality constraints and develop a majorization-guided switching proximal gradient (MGSPG) method. Specifically, at each feasible outer point, quadratic majorization and linearization yield a strongly convex composite surrogate problem. To solve this surrogate approximately, we employ a switching proximal gradient (SPG) method, which takes a proximal gradient step for the objective when the current point is nearly feasible and for a most violated constraint otherwise. This construction requires neither projection onto the joint surrogate feasible set nor multiplier computation. By establishing a common invariant ball and using an increasing weight argument, we obtain an \(O(\tau^{-1})\) inner complexity bound for SPG. Building on this bound, we show that, under boundedness of the feasible level set and a uniform Slater condition for the surrogates, MGSPG finds an \(\varepsilon\)-KKT point in \(O(\varepsilon^{-2})\) outer iterations and \(O(\varepsilon^{-4})\) selected component proximal gradient updates. Numerical experiments on SCAD-constrained and groupwise-constrained regression problems demonstrate the viability and computational efficiency of our method compared with existing optimization algorithms.

View source

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.