R.I.P.
👻
Ghosted
DC Decomposition of Nonconvex Polynomials with Algebraic Techniques
October 06, 2015 · Declared Dead · 🏛 Mathematical programming
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Amir Ali Ahmadi, Georgina Hall
arXiv ID
1510.01518
Category
math.OC: Optimization & Control
Cross-listed
cs.DS,
stat.ML
Citations
47
Venue
Mathematical programming
Last Checked
2 months ago
Abstract
We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) and find ones that speed up the convex-concave procedure (CCP). We prove, however, that optimizing over the entire set of dcds is NP-hard.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Optimization & Control
R.I.P.
👻
Ghosted
Local SGD Converges Fast and Communicates Little
R.I.P.
👻
Ghosted
On Lazy Training in Differentiable Programming
R.I.P.
👻
Ghosted
A Review on Bilevel Optimization: From Classical to Evolutionary Approaches and Applications
R.I.P.
👻
Ghosted
Learned Primal-dual Reconstruction
R.I.P.
👻
Ghosted
On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted