The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we ...The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.展开更多
In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a d...In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a double integrator model. Two different cases are considered in this study. One is the leader-following case and the other is leaderless case. Based on graph theory and common Lyapunov function method, some sufficient conditions are obtained for the consensus stability of the considered systems with the neighbour-based feedback laws in both leader-following case and leaderless case respectively. Finally, two numerical examples are given to illustrate the obtained results.展开更多
Quantum discord is the most prominent of quantum correlations, but it does not have unique generalizations to the multipartite case. W states are especially useful for secure communication. In this paper, we propose t...Quantum discord is the most prominent of quantum correlations, but it does not have unique generalizations to the multipartite case. W states are especially useful for secure communication. In this paper, we propose that the quantum correlation in generic three-qubit pure W states can be given by the two-qubit discords of these states.展开更多
It is known that a distance-regular graph with valency k at least three admits at most two Qpolynomial structures. We show that all distance-regular graphs with diameter four and valency at least three admitting two Q...It is known that a distance-regular graph with valency k at least three admits at most two Qpolynomial structures. We show that all distance-regular graphs with diameter four and valency at least three admitting two Q-polynomial structures are either dual bipartite or almost dual bipartite. By the work of Dickie(1995) this implies that any distance-regular graph with diameter d at least four and valency at least three admitting two Q-polynomial structures is, provided it is not a Hadamard graph, either the cube H(d, 2)with d even, the half cube 1/2H(2d + 1, 2), the folded cube?H(2d + 1, 2), or the dual polar graph on [2A2d-1(q)]with q 2 a prime power.展开更多
A new conjugate gradient method is proposed in this paper. For any （inexact） line search, our scheme satifies the sufficient descent property. The method is proved to be globally convergent if the restricted Wolfe-P...A new conjugate gradient method is proposed in this paper. For any （inexact） line search, our scheme satifies the sufficient descent property. The method is proved to be globally convergent if the restricted Wolfe-Powell line search is used. Preliminary numerical result shows that it is efficient.展开更多
文摘The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.
基金Project supported by the National Natural Science Foundation of China (Grant No. 60674071)
文摘In this paper, we consider multi-agent consensus problems in a decentralised fashion. The interconnection topology graph among the agents is switching and undirected. The agent dynamics is expressed in the form of a double integrator model. Two different cases are considered in this study. One is the leader-following case and the other is leaderless case. Based on graph theory and common Lyapunov function method, some sufficient conditions are obtained for the consensus stability of the considered systems with the neighbour-based feedback laws in both leader-following case and leaderless case respectively. Finally, two numerical examples are given to illustrate the obtained results.
基金supported by National Natural Science Foundation of China (NSFC) under Grant No.11271237 and No.61228305
文摘Quantum discord is the most prominent of quantum correlations, but it does not have unique generalizations to the multipartite case. W states are especially useful for secure communication. In this paper, we propose that the quantum correlation in generic three-qubit pure W states can be given by the two-qubit discords of these states.
基金supported by Natural Science Foundation of Hebei Province(Grant No.A2012205079)Science Foundation of Hebei Normal University(Grant No.L2011B02)the 100 Talents Program of the Chinese Academy of Sciences for support
文摘It is known that a distance-regular graph with valency k at least three admits at most two Qpolynomial structures. We show that all distance-regular graphs with diameter four and valency at least three admitting two Q-polynomial structures are either dual bipartite or almost dual bipartite. By the work of Dickie(1995) this implies that any distance-regular graph with diameter d at least four and valency at least three admitting two Q-polynomial structures is, provided it is not a Hadamard graph, either the cube H(d, 2)with d even, the half cube 1/2H(2d + 1, 2), the folded cube?H(2d + 1, 2), or the dual polar graph on [2A2d-1(q)]with q 2 a prime power.
基金Foundation item： the National Natural Science Foundation of China （No. 10761001） the Natural Science Foundation of Guangxi Province （No. 0542043）.
文摘A new conjugate gradient method is proposed in this paper. For any （inexact） line search, our scheme satifies the sufficient descent property. The method is proved to be globally convergent if the restricted Wolfe-Powell line search is used. Preliminary numerical result shows that it is efficient.
