An interior subgradient and a proximal linearized method for DC programming
Optimization and Control
2020-03-10 v1
Abstract
In this paper, we study the convergence of an interior subgradient and proximal methods for a DC (difference of convex functions) constrained minimization problem.
Cite
@article{arxiv.2003.04182,
title = {An interior subgradient and a proximal linearized method for DC programming},
author = {V. L. Sousa Junior},
journal= {arXiv preprint arXiv:2003.04182},
year = {2020}
}