Joël Benoist

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2015 J jnl
The Douglas-Rachford algorithm for the case of the sphere and the line.
J. Glob. Optim.
Joël Benoist
2014 J jnl
Study of a primal-dual algorithm for equality constrained minimization.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Riadh Omheni, Vincent Pateloup
2013 J jnl
From global to local convergence of interior methods for nonlinear optimization.
Optim. Methods Softw.
Paul Armand, Joël Benoist, Dominique Orban
2013 J jnl
Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods.
Math. Program.
Paul Armand, Joël Benoist
2012 J jnl
Local path-following property of inexact interior methods in nonlinear programming.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Jean-Pierre Dussault
2010 J jnl
Chebyshev approximation of the null function by an affine combination of complex exponential functions.
J. Approx. Theory
Paul Armand, Joël Benoist, Elsa Bousquet
2009 J jnl
Optimization of a one dimensional hypertelescope for a direct imaging in astronomy.
Eur. J. Oper. Res.
Paul Armand, Joël Benoist, Elsa Bousquet, Laurent Delage, Serge Olivier, François Reynaud
2008 J jnl
A local convergence property of primal-dual methods for nonlinear programming.
Math. Program.
Paul Armand, Joël Benoist
2008 J jnl
Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming.
Comput. Optim. Appl.
Paul Armand, Joël Benoist, Dominique Orban
2004 J jnl
Between quasi-convex and convex set-valued mappings.
Appl. Math. Lett.
Joël Benoist, Nicolae Popovici
2003 J jnl
Characterizations of convex and quasiconvex set-valued maps.
Math. Methods Oper. Res.
Joël Benoist, Nicolae Popovici
2003 J jnl
Contractibility of Efficient Frontier of Simply Shaded Sets.
J. Glob. Optim.
Joël Benoist
2002 J jnl
Integration of Fenchel Subdifferentials of Epi-Pointed Functions.
SIAM J. Optim.
Joël Benoist, Aris Daniilidis