We consider the problem of minimizing the difference of two nonsmooth convex functions
over a simple convex set. To deal with this class of nonsmooth and nonconvex optimization …

A function is called DC if it is expressible as the difference of two convex functions. In this
work, we present a short tutorial on difference-of-convex optimization surveying and …

We propose a general learning based framework for solving nonsmooth and nonconvex
image reconstruction problems. We model the regularization function as the composition of …

We introduce a new approach to apply the boosted difference of convex functions algorithm
(BDCA) for solving non-convex and non-differentiable problems involving difference of two …

We study the convergence of a modified proximal point method for DC functions in
Hadamard manifolds. We use the iteration computed by the proximal point method for DC …

We consider the constrained multi-objective optimization problem of finding Pareto critical
points of difference of convex functions. The new approach proposed by Bento et al.(SIAM J …

The complexity of the three-dimensional entry trajectory optimization problem has escalated
due to the need to liberalize the angle of attack and bank angle as control variables, thereby …

In this paper, we introduce a new proximal algorithm for equilibrium problems on a genuine
Hadamard manifold, using a new regularization term. We first extend recent existence …

We propose an inertial proximal point method for variational inclusion involving difference of
two maximal monotone vector fields in Hadamard manifolds. We prove that if the sequence …

This paper has two aspects. Mathematically, in the context of global optimization, it provides
the existence of an optimum of a perturbed optimization problem that generalizes the …