3 papers
math.OC2026
DC decompositions and cutting-plane approximation: geometry and complexity
Fahaar M. Pirani
We study how Difference of Convex (DC) decomposition affects cutting-plane approximation in global optimization. For a smooth decomposition , let be the dimension of t…
math.OC2026
Strong growth and Goldstein subgradients in piecewise smooth optimization
Adrian S. Lewis, Fahaar M. Pirani
We explore a new growth condition for Lipschitz functions around local minimizers, recently proposed in the context of Goldstein-subgradient-based algorithms and their behavior in…
math.OC2023
Algorithms for DC Programming via Polyhedral Approximations of Convex Functions
Fahaar Mansoor Pirani, Firdevs Ulus
There is an existing exact algorithm that solves DC programming problems if one component of the DC function is polyhedral convex (Loehne, Wagner, 2017). Motivated by this, first,…