The purpose of this work is to study discrete approximations of evolution equations governed by cocoercive operators by means of Euler iterations, both in a finite and in an infinite time horizon. On the one hand, we ...
详细信息
The purpose of this work is to study discrete approximations of evolution equations governed by cocoercive operators by means of Euler iterations, both in a finite and in an infinite time horizon. On the one hand, we give precise estimations for the distance between iterates of independently generated Euler sequences and use them to obtain bounds for the distance between the state, given by the continuous-time trajectory, and the discrete approximation obtained by the Euler iterations. On the other hand, we establish the asymptotic equivalence between the continuous- and discrete-time systems, under a sharp hypothesis on the step sizes, which can be removed for operators deriving from a potential. As a consequence, we are able to construct a family of smooth functions for which the trajectories/sequences generated by basic first-order methods converge weakly but not strongly, extending the counterexample of Baillon. Finally, we include a few guidelines to address the problem in smooth Banach spaces.
In this paper we propose a new dichotomic linear discrimination algorithm based on a criterion recursively defined from the min and max functions. This criterion allows us, using a gradient algorithm, to find two hype...
详细信息
In this paper we propose a new dichotomic linear discrimination algorithm based on a criterion recursively defined from the min and max functions. This criterion allows us, using a gradient algorithm, to find two hyperplanes which split two classes in an optimal way. We give two examples of the possibilities of the method.
improvement of performance analysis is discussed for the plain gradient-type adaptive IIR bilinear notch filters often used in the areas of communication, control, radar, and so on. Specifically, instead of the gradie...
详细信息
improvement of performance analysis is discussed for the plain gradient-type adaptive IIR bilinear notch filters often used in the areas of communication, control, radar, and so on. Specifically, instead of the gradient linearization in the conventional analysis, nonlinear terms are introduced in the approximate expression of the gradient and an explicit expression of the estimation variance of the gradient algorithm in the steady state is derived. In regard to the step size, the convergence condition is derived that guarantees convergence of the algorithm. Its effectiveness and limitation are clarified. (C) 2002 Wiley Periodicals, Inc.
In this note, we point out that the value range of iterative factor delta in Hajarian (2016) is not enough to guarantee the convergence result. We have rederived the proof process and got the correct value range of it...
详细信息
In this note, we point out that the value range of iterative factor delta in Hajarian (2016) is not enough to guarantee the convergence result. We have rederived the proof process and got the correct value range of iterative factor delta. A new scaling is given and then the value range of delta is greatly increased. (C) 2021 Elsevier Ltd All rights reserved.
We investigate two different formulations of gradient-based algorithms for the robust control of quantum systems. We consider the simultaneous control of an ensemble of systems which differ by the value of a constant ...
详细信息
We investigate two different formulations of gradient-based algorithms for the robust control of quantum systems. We consider the simultaneous control of an ensemble of systems which differ by the value of a constant Hamiltonian parameter. The two versions of the iterative algorithm, called concurrent and sequential, correspond respectively to a joint update of the control at each iteration for all the elements of the ensemble or to a successive correction of the control in which the control law is different for each system. We analyze the relative efficiency of the two optimization procedures on two benchmark examples, namely the control of two-level quantum systems and Bose-Einstein condensates in a one-dimensional optical lattice. Intensive numerical simulations show the superiority of the sequential-update formulation with respect to the concurrent one for a similar numerical cost.
Test cycle simulation is an essential part of the vehicle-in-the-loop test, and the deep reinforcement learning algorithm model is able to accurately control the drastic change of speed during the simulated vehicle dr...
详细信息
Test cycle simulation is an essential part of the vehicle-in-the-loop test, and the deep reinforcement learning algorithm model is able to accurately control the drastic change of speed during the simulated vehicle driving process. In order to conduct a simulated cycle test of the vehicle, a vehicle model including driver, battery, motor, transmission system, and vehicle dynamics is established in MATLAB/Simulink. Additionally, a bench load simulation system based on the speed-tracking algorithm of the forward model is established. Taking the driver model action as input and the vehicle gas/brake pedal opening as the action space, the deep deterministic policy gradient (DDPG) algorithm is used to update the entire model. This process yields the dynamic response of the output end of the bench model, ultimately producing the optimal intelligent driver model to simulate the vehicle's completion of the World Light Vehicle Test Cycle (WLTC) on the bench. The results indicate that the algorithm exhibits good convergence in the simulation, throughout the WLTC simulation, the driver always kept the vehicle speed error within 1 km/h, and the response time is less than 0.5 s under the vehicle's starting condition. In comparison to the PID control algorithm and the model predictive control (MPC) algorithm, it demonstrates smaller speed error and response time, ensuring accuracy, high efficiency, and safety during the indoor vehicle-in-the-loop test.
This paper presents an energy management method to optimally control the energy supply and the temperature settings of distributed heating and ventilation systems for residential buildings. The control model attempts ...
详细信息
This paper presents an energy management method to optimally control the energy supply and the temperature settings of distributed heating and ventilation systems for residential buildings. The control model attempts to schedule the supply and demand simultaneously with the purpose of minimizing the total costs. Moreover, the Predicted Percentage of Dissatisfied (PPD) model is introduced into the consumers' cost functions and the quadratic fitting method is applied to simplify the PPD model. An energy management algorithm is developed to seek the optimal temperature settings, the energy supply, and the price. Furthermore, due to the ubiquity of price oscillations in electricity markets, we analyze and examine the effects of price oscillations on the performance of the proposed algorithm. Finally, the theoretical analysis and simulation results both demonstrate that the proposed energy management algorithm with price oscillations can converge to a region around the optimal solution.
This paper is about the control design of hybrid dynamical systems modeled with Petri nets. For this purpose, continuous Petri nets with variable speeds are described as state space representations. In this context, t...
详细信息
This paper is about the control design of hybrid dynamical systems modeled with Petri nets. For this purpose, continuous Petri nets with variable speeds are described as state space representations. In this context, the marking vector is considered as a state space vector, the model outputs are defined by subnets, and the transitions are divided into internal ones and external ones (i.e. source and sink transitions) that correspond to the model inputs. gradient-based controllers are proposed in order to adapt the firing speeds of the source and sink transitions according to a desired trajectory of the output marking.
In this paper, a global peak searching algorithm is proposed for multimodal optimization problem. The proposed algorithm is built through combining gradient-based stochastic extremum seeking method with iterative appr...
详细信息
In this paper, a global peak searching algorithm is proposed for multimodal optimization problem. The proposed algorithm is built through combining gradient-based stochastic extremum seeking method with iterative approach. By increasing the initial search point, the gradient-based stochastic extremum seeking algorithm with different initial condition is iteratively operated to seek a list of the local extreme values near different initial points. Then, the global peak can be found by comparing the list of the local extreme values. The stability anlysis and working process of the global peak searching algorithm is proven. Simulation results are given to show the effectiveness of the proposed control method.
Images are commonly analysed by the discrete cosine transform (DCT) on a number of blocks of smaller size. The blocks are then combined back to the original size image. Since the DCT of blocks have a few nonzero coeff...
详细信息
ISBN:
(纸本)9789532330922
Images are commonly analysed by the discrete cosine transform (DCT) on a number of blocks of smaller size. The blocks are then combined back to the original size image. Since the DCT of blocks have a few nonzero coefficients, the images can be considered as sparse in this transformation domain. The theory of compressive sensing states that some corrupted pixels within blocks can be reconstructed by minimising the blocks sparsity in the DCT domain. Block edges can affect the quality of the reconstruction. In some blocks, a few pixels from an object which mostly belongs to the neighbouring blocks may appear at the edges. Compressive sensing reconstruction algorithm can recognise these pixels as disturbance and perform their false reconstruction in order to minimise the sparsity of the considered block. To overcome this problem, a method with overlapping blocks is proposed. Images are analysed with partially overlapping blocks and then reconstructed using their non-overlapped parts. We have demonstrated the improvements of overlapping blocks on images corrupted with combined noise. A comparison between the reconstructions with non-overlapping and overlapping blocks is presented using the structural similarity index.
暂无评论