Jacques Borde

Learn More
The convergence of a Dinkelbach-type algorithm in generalized fractional programming is obtained by considering the sensitivity of a parametrized problem. We show that the rate of convergence is at least equal to (1 + 0)/2 when regularity conditions hold in a neighbourhood of the optimal solution. We give also a necessary and sufficient condition for the(More)
2014 We present a general framework in which non-linear optical phenomena for an ensemble of accelerated atoms can be studied. We show the equivalence of various approaches through frame transformations. This equivalence is understood within the context of a covariant formalism which is briefly sketched. The choice of the frame, in which the atoms are not(More)
  • 1