1 citations · 1 across the 4 of their papers we have counts for
4 papers
A subgradient method with non-monotone line search
O. P. Ferreira, G. N. Grapiglia, E. M. Santos +1
In this paper we present a subgradient method with non-monotone line search for the minimization of convex functions with simple convex constraints. Different from the standard sub…
The difference of convex algorithm on Hadamard manifolds
Ronny Bergmann, Orizon P. Ferreira, Elianderson M. Santos +1
In this paper, we propose a Riemannian version of the difference of convex algorithm (DCA) to solve a minimization problem involving the difference of convex (DC) function. We esta…
A boosted DC algorithm for non-differentiable DC components with non-monotone line search
Orizon P. Ferreira, Elianderson M. Santos, João Carlos O. Souza
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…
Boosted scaled subgradient method for DC programming
Orizon P. Ferreira, Elianderson M. Santos, João Carlos O. Souza
The purpose of this paper is to present a boosted scaled subgradient-type method (BSSM) to minimize the difference of two convex functions (DC functions), where the first function…