Login / Signup
A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems.
Tianxiang Liu
Ting Kei Pong
Akiko Takeda
Published in:
Math. Program. (2019)
Keyphrases
</>
convex functions
optimization problems
objective function
cost function
significant improvement
neural network
genetic algorithm
segmentation method
closed form
multi objective
optimization method
sensitivity analysis
convex optimization
globally convergent