In this paper we consider the data assimilation problem for a timedependent transport problem in a slab when the initial condition is not known. The spaces of traces are introduced, the solvability of the original initial-boundary value transport problem is studied. The properties of the control operator are investigated, the solvability of the data assimilation problem is proved. The class of iterative methods for solving the problem is considered, and the convergence conditions are studied. The...

In this note, we employ nonlinear on-line parameter estimation methods based on adaptive neural network approximators for detecting changes due to actuator faults in a class of second order distributed parameter systems. The motivating example is a cantilevered beam actuated via a pair of piezoceramic patches. We examine changes in the control input term, which provide a simple and practical model of actuator failures. Using Lyapunov redesign methods, a stable learning scheme for fault diagnosis...

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.

We extend thresholding methods for numerical realization of mean curvature flow on obstacles to the anisotropic setting where interfacial energy depends on the orientation of the interface. This type of schemes treats the interface implicitly, which supports natural implementation of topology changes, such as merging and splitting, and makes the approach attractive for applications in material science. The main tool in the new scheme are convolution kernels developed in previous studies that approximate...

Differential evolution algorithm combined with chaotic pattern search(DE-CPS) for global optimization is introduced to improve the performance of simple DE algorithm. Pattern search algorithm using chaotic variables instead of random variables is used to accelerate the convergence of solving the objective value. Experiments on 6 benchmark problems, including morbid Rosenbrock function, show that the novel hybrid algorithm is effective for nonlinear optimization problems in high dimensional space....

We prove a convergence result for a time discrete process of the form $x(t+h)-x\left(t\right)=hV(h,x(t+{\alpha }_1\left(t\right)h),...,x(t+{\alpha }_L\left(t\right)h))t=T+jh,j=0,...,\sigma \left(h\right)-1$ under weak conditions on the function $V$. This result is a slight generalization of the convergence result given in [5].Furthermore, we discuss applications to minimizing problems, boundary value problems and systems of nonlinear equations.

The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper...

The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper...

Two universally applicable smoothing operations adjustable to meet the specific properties of the given smoothing problem are widely used: 1. Smoothing splines and 2. Smoothing digital convolution filters. The first operation is related to the data vector $r={(r_0,...,r_{n-1})}^T$ with respect to the operations $𝒜$, $ℒ$ and to the smoothing parameter $\alpha$. The resulting function is denoted by ${\sigma }_{\alpha }\left(t\right)$. The measured sample $r$ is defined on an equally spaced mesh $\Delta ={\{t_i=ih\}}_{i=0}^{n-1}$$...$

In this paper, we study the distributed optimization problem using approximate first-order information. We suppose the agent can repeatedly call an inexact first-order oracle of each individual objective function and exchange information with its time-varying neighbors. We revisit the distributed subgradient method in this circumstance and show its suboptimality under square summable but not summable step sizes. We also present several conditions on the inexactness of the local oracles to ensure...

An axisymmetric second order elliptic problem with mixed boundary conditions is considered. A part of the boundary has to be found so as to minimize one of four types of cost functionals. The existence of an optimal boundary is proven and a convergence analysis for piecewise linear approximate solutions presented, using weighted Sobolev spaces.

For an elliptic model problem with non-homogeneous unilateral boundary conditions, two dual variational formulations are presented and justified on the basis of a saddle point theorem. Using piecewise linear finite element models on the triangulation of the given domain, dual numerical procedures are proposed. By means of one-sided approximations, some a priori error estimates are proved, assuming that the solution is sufficiently smooth. A posteriori error estimates and two-sided bounds for the...