In this paper we examine a problem of digitized curves approximation for raster graphics vectorization and develop an efficient implementation of a near-optimal Dynamic Programming algorithm for digitized curves approximation with cubic Bézier splines for a given distortion bound. For better fitting performance, we introduce the inflection points with relaxed constraint of tangent continuity. T...

In this paper, a heuristic improvement of the truncated window dynamic programming (DP-VW) has been studied for the unit commitment application. The proposed method employs a variable window size according to load demand increments, and corresponding experimental results indicate a substantial saving in the computation time without sacrificing the quality of the solution. An iterative process f...

We present a new iterative procedure for solving the multiple stopping problem in discrete time and discuss the stability of the algorithm. The algorithm produces monotonically increasing approximations of the Snell envelope, which coincide with the Snell envelope after finitely many steps. Contrary to backward dynamic programming, the algorithm allows to calculate approximative solutions with ...

This paper deals with the existence, uniqueness and iterative approximations of solutions for the functional equations and system of functional equations arising in dynamic programming of multistage decision making processes in Banach spaces and complete metric space, respectively. The results presented in this paper unify and generalize many known results in the literature. Some examples which...

We consider linear systems of equations and solution approximations derived by projection on a lowdimensional subspace. We propose stochastic iterative algorithms, based on simulation, which converge to the approximate solution and are suitable for very large-dimensional problems. The algorithms are extensions of recent approximate dynamic programming methods, known as temporal difference metho...

Fast algorithm for joint near-optimal approximation of multiple polygonal curves is proposed. It is based on iterative reduced search dynamic programming introduced earlier for the minproblem of a single polygonal curve. The proposed algorithm jointly optimizes the number of line segments allocated to the different individual curves, and the approximation of the curves by the given number of se...