Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains

Simulated annealing is a popular method for approaching the solution of a global optimization problem. Existing results on its performance apply to discrete combinatorial optimization where the optimization variables can assume only a finite set of possible values. We introduce a new general formulation of simulated annealing which allows one to guarantee finite-time performance in the optimization of functions of continuous variables. The results hold universally for any optimization problem on a bounded domain and establish a connection between simulated annealing and up-to-date theory of convergence of Markov chain Monte Carlo methods on continuous domains. This work is inspired by the concept of finite-time learning with known accuracy and confidence developed in statistical learning theory.

Finite element solution of Navier Stokes equations adapted to a priori error estimates

The paper is based on qualitative properties of the solution of the Navier-Stokes equations for incompressible fluid, and on properties of their finite element solution. In problems with corner-like singularities (e.g. on the well-known L-shaped domain) usually some adaptive strategy is used. In this paper we present an alternative approach. For flow problems on domains with corner singularities we use the a priori error estimates and asymptotic expansion of the solution to derive an algorithm for refining the mesh near the corner. It gives very precise solution in a cheap way. We present some numerical results.