The impulse control of a Markov–Feller process is considered when the impulses are allowed only when a signal arrives. This is referred to as an impulse control problem with constraint. A detailed setting is described, a characterization of the optimal cost is obtained using previous results of the authors on optimal stopping problems with constraint, and an optimal impulse control is identified.

We propose a way to define the most expensive operation to be used in evaluations of complexity and efficiency for simulated distributed constraint reasoning (DCR) algorithms. We also report experiments showing that the cost associated with a constraint check, even within the same algorithm, depends on the problem size. The DCR research has seen heated debate regarding the correct way to evalua...

Constraint reduction is an essential method because the computational cost of the interior point methods can be effectively saved. Park and O’Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global convergence, but they did not show its superlinear convergence. We first develop a constraintreduced algorithm for semidefinite programmi...

The purpose of this paper is to relax the terminal conditions typically used to ensure stability in model predictive control, thereby enlarging the domain of attraction for a given prediction horizon. Using some recent results, we present novel conditions that employ, as the terminal cost, the finite-horizon cost resulting from a nonlinear controller u = −sat(Kx) and, as the terminal constraint...

A deterministic annealing algorithm for the design of tiedmixture HMM recognizers is proposed, which reduces the training sensitivity to parameter initialization, automatically smoothes the classification error cost function to allow gradientbased optimization, and seeks better solutions than known techniques. The new approach introduces randomness into the classification rule during the traini...

Given a tree T (V, E) endowed with a length function l and a cost function c, the diameter lowering problem consists in finding the reals 0 ≤ x(e) ≤ l(e), e E such that the tree obtained from T by decreasing the length of every edge e by x(e) units has a minimal diameter subject to the constraint ¥e Ec(e)x(e) ≤ B, where B is the available budget (analogously, one can minimize the cost of loweri...

In this paper, we study the problem of routing under multiple constraints. We consider a graph where each edge is labeled with a cost and a delay. We then consider the problem of finding a path from a source vertex to a destination vertex such that the sum of the costs on the path satisfy the cost constraint and the sum of the delays satisfy the delay constraint. We present three different algo...

Recent developments of efficient propagators, operations and creation methods for MDDs allow us to directly build efficient MDD-based models, without the need of intermediate data structures. In this paper, we make another step in this direction by defining efficient methods to handle cost and soft versions of the MDD constraint. First, we improve the existing algorithms, then we propose to per...

Some recent advances in stability and optimality for the nonlinear receding horizon control (NRHC) or the nonlinear model predictive control (NMPC) are assessed. The NRHCs with terminal conditions are surveyed in terms of a terminal state equality constraint, a terminal cost, and a terminal constraint set. Other NRHCs without terminal conditions are surveyed in terms of a control Lyapunov funct...

Test planning for core-based 3D stacked ICs under power constraint is different from test planning for non-stacked ICs as the same test schedule cannot be applied both at wafer sort and package test. In this paper, we assume a test flow where each chip is tested individually at wafer sort and jointly at package test. We define cost functions and test planning optimization algorithms for non-sta...