Login / Signup
The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions.
Francisco J. Aragón Artacho
Phan Tu Vuong
Published in:
SIAM J. Optim. (2020)
Keyphrases
</>
convex functions
dc programming
objective function
learning algorithm
linear program
piecewise linear
np hard
primal dual
k means
dynamic programming
worst case
constrained optimization
high dimensional
probabilistic model
em algorithm
finite number
globally optimal
computational complexity
global optimality