Convergence of Distributed Gradient-Tracking-Based Optimization Algorithms with Random Graphs

This paper studies distributed convex optimization over a multi-agent system, where each agent owns only a local cost function with convexity and Lipschitz continuous gradients. The goal of the agents is to cooperatively minimize a sum of the local cost functions. The underlying communication networks are modelled by a sequence of random and balanced digraphs, which are not required to be spatially or temporally independent and have any special distributions. The authors use a distributed gradient-tracking-based optimization algorithm to solve the optimization problem. In the algorithm,each agent makes an estimate of the optimal solution and an estimate of the average of all the local gradients. The values of the estimates are updated based on a combination of a consensus method and a gradient tracking method. The authors prove that the algorithm can achieve convergence to the optimal solution at a geometric rate if the conditional graphs are uniformly strongly connected, the global cost function is strongly convex and the step-sizes don't exceed some upper bounds.     

马氏转移高敏感跳扩散CKLS模型的解及金融应用

将马氏转移切换机制和泊松过程引入到CKLS短期利率模型中,构建马氏转移跳扩散CKLS模型.理论方面,利用Lyapunov函数方法证明了马氏转移跳扩散CKLS模型存在唯一的全局正解并给出了该解的分析性质(包括一阶矩二阶矩的有界性,随机有界性和路径估计);用欧拉离散化方法得到马氏转移跳扩散CKLS模型的欧拉数值解,证明了其依概率收敛于解析解.应用方面,以债券定价和障碍期权的期望收益为例给出了马氏转移跳扩散CKLS模型数值解的收敛性在金融领域中的应用.基于7天Shibor利率的实证分析,说明了马氏转移跳扩散CKLS模型对我国金融市场中动态利率建模更加合理和有效.     

Finite Time Consensus Problem for Multiple Non-Holonomic Agents with Communication Delay

In this paper, finite time consensus problem is discussed for multiple non-holonomic mobile agents with constant communication delay. The objective is to design non-smooth distributed control laws such that multiple non-holonomic mobile agents can be all in agreement within any given finite time larger than communication delay. The authors propose a novel switching control strategy with the help of Lyapunov-based method and graph theory.     

A Class of Jump-Diffusion Stochastic Differential System Under Markovian Switching and Analytical Properties of Solutions

Our article discusses a class of Jump-diffusion stochastic differential system under Markovian switching(JD-SDS-MS). This model is generated by introducing Poisson process and Markovian switching based on a normal stochastic differential equation. Our work dedicates to analytical properties of solutions to this model. First, we give some properties of the solution, including existence,uniqueness, non-negative and global nature. Next, boundedness of first moment of the solution to this model is considered. Third, properties about coefficients of JD-SDS-MS is proved by using a right continuous markov chain. Last, we study the convergence of Euler-Maruyama numerical solutions and apply it to pricing bonds.     

A new descent memory gradient method and its global convergence

In this article, a new descent memory gradient method without restarts is proposed for solving large scale unconstrained optimization problems. The method has the following attractive properties: 1) The search direction is always a sufficiently descent direction at every iteration without the line search used; 2) The search direction always satisfies the angle property, which is independent of the convexity of the objective function. Under mild conditions, the authors prove that the proposed method has global convergence, and its convergence rate is also investigated. The numerical results show that the new descent memory method is efficient for the given test problems.     

Optimal Switching Integrity Attacks on Sensors in Industrial Control Systems

In this article, an optimal switching integrity attack problem is investigated to study the response of feedback control systems under attack. The authors model the malicious attacks on sensors as additive norm bounded signals. The authors consider an attacker who is only capable of launching attacks to limited number of sensors once a time and changing the combinations of attacked sensors all over the time. The objective of this paper is to find the optimal switching sequence of these combinations and the optimal attack input. The authors solve this problem by transforming it into a traditional optimal control problem with new control variables vary continuously in the range [0, 1]. The optimal solutions of the new control variables are of bang-bang-type. Therefore, an algebraic switching condition and an optimal attack input can be obtained. Finally, numerical results are provided to illustrate the effectiveness of the methods.     

An affine scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming

This paper proposes an arlene scaling derivative-free trust region method with interior backtracking technique for bounded-constrained nonlinear programming. This method is designed to get a stationary point for such a problem with polynomial interpolation models instead of the objective function in trust region subproblem. Combined with both trust region strategy and line search technique, at each iteration, the affine scaling derivative-free trust region subproblem generates a backtracking direction in order to obtain a new accepted interior feasible step. Global convergence and fast local convergence properties are established under some reasonable conditions. Some numerical results are also given to show the effectiveness of the proposed algorithm.     

Distributed Algorithm for Robust Resource Allocation with Polyhedral Uncertain Allocation Parameters

This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the (nonsmooth) objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint, which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization, the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors’ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.     

具有瞬时耦合及通讯时滞的调和振子同步动力学

针对具有局部瞬时耦合及通讯延时的调和振子动力网络系统,给出了一种分布式同步算法。分别在无向固定拓扑和切换拓扑两种情形下给出了同步态的解析表达式,以及耦合系统的解析解,并给出了一些一般而简单的同步化准则。结果表明网络化的调和振子在比较弱的瞬时网络连通条件下,可以达到同步状态。数值模拟表明所给理论结果的正确性和有效性。     

基于异步动态的多机器人系统的一致性

研究通过无线网络进行通信的多机器人系统的一致性问题。多机器人系统在固定通信拓扑下可建模为特定的网络控制系统,考虑信道噪声、不确定短时延和数据包丢失等因素的影响时,其可进一步视作由丢包率约束的异步动态系统。通过构造李雅普诺夫(Lyapunov)函数,运用线性矩阵不等式(linear matrix inequality, LMI)方法,得到了该系统指数稳定的充分条件。为实现多机器人系统的运动一致性,设计了控制器；讨论了不同的指数收敛率对多机器人系统收敛速度的影响,并进行了相应的理论证明和仿真验证。     

引导函数支配的进化模糊聚类算法

建立了多维属性样本的模糊聚类目标函数.构建了引导进化算法收敛的指数函数曲线模型,给出了模型的参数计算方法.设计了一种具有全局变异和局部变异算子的进化模糊聚类算法,根据全局变异前后个体适应度值和分量值的变化趋势,实现定向变异,并给出了算法的种群进化策略.选择文本分类和点聚类计算实例,实验表明,设计的引导函数是有效的.进化模糊聚类算法具有较强的局部寻优能力,在收敛速度和聚类精度方面优于比较的遗传模糊C-均值聚类等算法.     

Four step scheme for general Markovian forward-backward SDES

<正> This paper studies a class of forward-backward stochastic differential equations (FBSDE)in a general Markovian framework.The forward SDE represents a large class of strong Markov semimartingales,and the backward generator requires only mild regularity assumptions.The authors showthat the Four Step Scheme introduced by Ma,et al.(1994) is still effective in this case.Namely,the authors show that the adapted solution of the FBSDE exists and is unique over any prescribedtime duration;and the backward components can be determined explicitly by the forward componentvia the classical solution to a system of parabolic integro-partial differential equations.An importantconsequence the authors would like to draw from this fact is that,contrary to the general belief,in aMarkovian set-up the martingale representation theorem is no longer the reason for the well-posednessof the FBSDE,but rather a consequence of the existence of the solution of the decoupling integralpartialdifferential equation.Finally,the authors briefly discuss the possibility of reducing the regularityrequirements of the coefficients by using a scheme proposed by F.Delarue (2002) to the current case.     

全局收敛的投影单纯形方法

对于线性约束、非线性目标的优化问题，文献［１］的作者以极小化条件代替求正交投影的一组正交条件，并用一个特殊的线性规划模型来确定迭代方向，由此给出了一个算法。但文献［１］没有讨论算法的收敛性，且一般说来，这种算法不具备收敛性质［５］。本文沿用［１］的迭代方向ｄ（ｘ）的表示形式，给出了一个新的算法，讨论了算法性质，证明了算法具有全局收敛性.     

A line search filter inexact SQP method for nonlinear equality constrained optimization

This paper proposes an inexact SQP method in association with line search filter technique for solving nonlinear equality constrained optimization.For large-scale applications,it is expensive to get an exact search direction,and hence the authors use an inexact method that finds an approximate solution satisfying some appropriate conditions.The global convergence of the proposed algorithm is established by using line search filter technique.The second-order correction step is used to overcome the Maratos effect,while the line search filter inexact SQP method has q-superlinear local convergence rate.Finally,the results of numerical experiments indicate that the proposed method is efficient for the given test problems.     

H_2/H_∞ Control for Stochastic Jump-Diffusion Systems with Markovian Switching

In this paper, a stochastic H_2/H_∞ control problem is investigated for Poisson jumpdiffusion systems with Markovian switching, which are driven by a Brownian motion and a Poisson random measure with the system parameters modulated by a continuous-time finite-state Markov chain.A stochastic jump bounded real lemma is proved, which reveals that the norm of the perturbation operator below a given threshold is equivalent to the existence of a global solution to a parameterized system of Riccati type differential equations. This result enables the authors to obtain sufficient and necessary conditions for the existence of H_2/H_∞ control in terms of two sets of interconnected systems of Riccati type differential equations.     

Stochastic Channel Allocation for Nonlinear Systems with Markovian Packet Dropout

This paper addresses a channel scheduling problem for group of dynamically decoupled nonlinear subsystems with actuators connected through digital communication channels and controlled by a centralized controller. Due to the limited communication capacity, only one channel can be activated and hence there is only one pair of sensor and actuator can communicate with the controller at each time instant. In addition, the communication channels are not reliable so Markovian packed dropout is introduced. A predictive control framework is adopted for controller/scheduler co-design to alleviate the performance loss caused by the limited communication capacity. Instead of sending a single control value, the controller sends a sequence of predicted control values to a selected actuator so that there are control input candidates which can be fed to the subsystem when the actuator does not communicate with the controller. A stochastic algorithm is proposed to schedule the usage of the communication medium and sufficient conditions on stochastic stability are given under some mild assumptions.     

Distributed tracking control of second-order multi-agent systems under measurement noises

This paper considers a leader-following tracking control problem for second-order multiagent systems（MASs） under measurement noises and directed communication channels.It is assumed that each follower-agent can measure the relative positions and velocities of its neighbors in a noisy environment.Based on a novel velocity decomposition technique,a neighbor-based control law is designed to realize local control strategies for these continuous-time agents.It is shown that the proposed consensus protocol can guarantee that all the follower-agents track the active leader.In addition,this result is extended to a more general case with switching topologies.Finally,a numerical example is given for illustration.     

Distributed Consensus-Based K-Means Algorithm in Switching Multi-Agent Networks

This paper discusses a distributed design for clustering based on the K-means algorithm in a switching multi-agent network, for the case when data are decentralized stored and unavailable to all agents. The authors propose a consensus-based algorithm in distributed case, that is, the doubleclock consensus-based K-means algorithm(DCKA). With mild connectivity conditions, the authors show convergence of DCKA to guarantee a distributed solution to the clustering problem, even though the network topology is time-varying. Moreover, the authors provide experimental results on various clustering datasets to illustrate the effectiveness of the fully distributed algorithm DCKA, whose performance may be better than that of the centralized K-means algorithm.     

基于改进边际优化的离散变量优化设计算法

针对传统离散变量优化方法存在的目标函数测算次数多、收敛性不佳等问题,借鉴边际优化理论和模式搜索算法,设计了一种基于改进边际优化的离散变量优化设计算法。借鉴边际效用优化原理,通过引入周围单位步长空间的概念,在初始点选择、边际增量设计、禁忌搜索策略等方面进行了改进,并设计了变异操作以跳出局部最优。实例分析表明,所提算法能够快速准确地收敛到局部最优解,实现以尽可能少的目标函数测算得到问题的满意解或最优解,适合于求解高维离散变量优化问题和仿真优化问题。     

存在基站误差的稳健时差定位算法

针对存在基站误差的目标无源定位问题,提出了一种基于修正牛顿算法的时差定位技术。众所周知,牛顿法对初值要求较高,较差初值会导致迭代发散,而且基站位置误差也会导致牛顿算法Hessian矩阵维数扩大和目标函数的缓慢下降,使运算量变大。该算法利用最大似然方法确定目标函数,运用牛顿法对目标位置进行迭代求解,对于计算过程中可能出现的病态Hessian矩阵,引入正则化理论修正病态的Hessian矩阵,使保证迭代收敛,同时简化算法降低Hessian矩阵的维数并且加速目标函数的下降趋势,使目标位置解脱离局部最小值,算法能够稳健高效的运行。实验结果表明:相对于传统牛顿法,此算法在初始值的选取上具有稳健性,对误差选取较大的初始值,仍能够保证算法的收敛性,同时加速了收敛速度,降低了计算量;相对于现有闭合式定位方法,此算法在噪声较大时具有较好的定位精度。