An interior subgradient and a proximal linearized method for DC programming
In this paper, we study the convergence of an interior subgradient and proximal methods for a DC (difference of convex functions) constrained minimization problem.
math.OC↗
arXiv subjects
Publications and source records attributed to V. L. Sousa Junior.
In this paper, we study the convergence of an interior subgradient and proximal methods for a DC (difference of convex functions) constrained minimization problem.
The proximal point method for a special class of nonconvex multiobjective functions is studied in this paper. We show that the method is well defined and that the accumulation points of any generated sequence, if any, are Pareto--Clarke critical points. Moreover, under additional assumptions, we show the full convergence of the generated sequence.