4 citations · 4 across the 3 of their papers we have counts for
5 papers
Frank-Wolfe algorithm for star-convex functions
R. Diaz Millan, Orizon Pereira Ferreira, Julien Ugon
We study the Frank-Wolfe algorithm for minimizing a differentiable function with Lipschitz continuous gradient over a compact convex set. To extend classical complexity bounds to c…
An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
Orizon P. Ferreira, Boris S. Mordukhovich, Wilkreffy M. S. Santos +1
In this paper, we introduce an inexact approach to the Boosted Difference of Convex Functions Algorithm (BDCA) for solving nonconvex and nondifferentiable problems involving the di…
Approximate Douglas-Rachford algorithm for two-sets convex feasibility problems
R. Díaz Millán, O. P. Ferreira, J. Ugon
In this paper, we propose a new algorithm combining the Douglas-Rachford (DR) algorithm and the Frank-Wolfe algorithm, also known as the conditional gradient (CondG) method, for so…
Subgradient method with feasible inexact projections for constrained convex optimization problems
Ademir Alves Aguiar, Orizon Pereira Ferreira, Leandro da Fonseca Prudente
In this paper, we propose a new inexact version of the projected subgradient method to solve nondifferentiable constrained convex optimization problems. The method combine -subg…
Alternating conditional gradient method for convex feasibility problems
R. Díaz Millán, O. P. Ferreira, L. F. Prudente
The classical convex feasibility problem in a finite dimensional Euclidean space is studied in the present paper. We are interested in two cases. First, we assume to know how to co…