Tacking—a maneuver used to sail a boat against the wind, changing direction in a zig-zag fashion—is one of the most difficult ...

Crystals are known far and wide for their beauty and elegance. But even though they may appear perfect on the outside, their ...

In particular, we obtain robust online algorithm for fairly general online convex problems: we consider the MIXED model where in some of the time steps the data is stochastic and in the others the ...

The main design difficulty lies in the discrete phase-shift constraint. Differing from most existing works, this letter advocates a convex-hull relaxation of the discrete constraints which leads to a ...

Specifically, we propose a non-convex sparse regularization model based on the Cauchy function and design an effective solution algorithm based on the proximal gradient.

Fully dynamic setting. In the fully dynamic setting, we have a stream of point insertion and deletion queries, and the objective is to quickly rebuild the hull without discarding any of the points in ...