# A General System for Heuristic Solution of Convex Problems over Nonconvex Sets

arXiv: https://arxiv.org/abs/1601.07277 · HTML: https://mlsanity.com/paper/1601.07277/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 27 Jan 2016.

## Built on by (most cited first, 5 of 5)

- [Workflow Optimization for Parallel Split Learning](https://mlsanity.com/paper/2402.10092/) (2024)
- [Quantization Aware Factorization for Deep Neural Network Compression](https://mlsanity.com/paper/2308.04595/) (2023)
- [Stage-Aware Learning for Dynamic Treatments](https://mlsanity.com/paper/2310.19300/) (2023)
- [Dynamic Topic Language Model on Heterogeneous Children's Mental Health Clinical Notes](https://mlsanity.com/paper/2312.14180/) (2023)
- [Orientation Estimation of Cryo-EM Images for Molecules with Arbitrary Symmetry by Semidefinite Programming](https://mlsanity.com/paper/2610.18691/) (2026)

## Abstract (arXiv)

We describe general heuristics to approximately solve a wide variety of problems with convex objective and decision variables from a nonconvex set. The heuristics, which employ convex relaxations, convex restrictions, local neighbor search methods, and the alternating direction method of multipliers (ADMM), require the solution of a modest number of convex problems, and are meant to apply to general problems, without much tuning. We describe an implementation of these methods in a package called NCVX, as an extension of CVXPY, a Python package for formulating and solving convex optimization problems. We study several examples of well known nonconvex problems, and show that our general purpose heuristics are effective in finding approximate solutions to a wide variety of problems.