The linear sampling method revisited

Linear Thompson Sampling Revisited

We derive an alternative proof for the regret of Thompson sampling (TS) in the stochastic linear bandit setting. While we obtain a regret bound of order e O(d3/2 p T ) as in previous results, the proof sheds new light on the functioning of the TS. We leverage on the structure of the problem to show how the regret is related to the sensitivity (i.e., the gradient) of the objective function and h...

The linear sampling method for anisotropic media

We consider the inverse scattering problem of determining the support of an anisotropic inhomogeneous medium from a knowledge of the incident and scattered time harmonic acoustic wave at 1xed frequency. To this end, we extend the linear sampling method from the isotropic case to the case of anisotropic medium. In the case when the coe6cients are real we also show that the set of transmission ei...

The linear sampling method for cracks

We consider the inverse scattering problem of determining the shape of an infinite cylinder having an open arc as cross section from a knowledge of the TM-polarized scattered electromagnetic field corresponding to time-harmonic incident plane waves propagating from arbitrary directions. We assume that the arc is a (possibly) partially coated perfect conductor and develop the linear sampling met...

The Linear Sampling Method for Anisotropi

SOLVING FUZZY LINEAR PROGRAMMING PROBLEMS WITH LINEAR MEMBERSHIP FUNCTIONS-REVISITED

Recently, Gasimov and Yenilmez proposed an approach for solving two kinds of fuzzy linear programming (FLP) problems. Through the approach, each FLP problem is first defuzzified into an equivalent crisp problem which is non-linear and even non-convex. Then, the crisp problem is solved by the use of the modified subgradient method. In this paper we will have another look at the earlier defuzzifi...