In this paper we present some algorithms for minimization of DC function (difference of two convex functions). They are descent methods of the proximal-type which use the convex properties of the two ...

Abstract. We consider sensitivity functionals and Lagrange multiplier method for solving finite dimensional convex optimization problem.An analysis based on this property is also applied for ...

Convex optimisation constitutes a fundamental area in applied mathematics where the objective is to identify the minimum of a convex function subject to a set of convex constraints. This framework ...