搜索结果: 1-15 共查到“信息科学与系统科学 Problems”相关记录24条 . 查询时间(0.109 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars:Inverse Problems and Their Applications
逆问题 系统辨识 正问题
2023/5/12
Structured and simultaneous Lyapunov functions for system stability problems
Lyapunov function system robustness quadratic lyapunov function the numerical values
2015/8/13
It is shown that many system stability and robustness problems can be reduced to the question of when there is a quadratic Lyapunov function of a certain structure which establishes stability of dx/dt...
A branch and bound methodology for matrix polytope stability problems arising in power systems
Robust matrix of power system the linearized dynamics linear system model robust stability
2015/8/12
This paper proposes a formulation to provide necessary and sufficient conditions for robust stability of a family of matrices modeling linearized power system dynamics. A construction for transforming...
A path-following method for solving BMI problems in control
Bilinear matrix inequality linear matrix in-equality semide
2015/8/11
In this paper we present a path-following (homotopy) method for (locally) solving bilinear matrix inequality (BMI) problems in control. The method is to linearize the BMI using a first order perturbat...
Decentralized Stochastic Decision Problems and Polynomial Optimization
Decision Problems Polynomial Optimization
2015/6/19
In this paper we consider the problem of determining optimal decentralized decision rules in discrete stochastic decision problems. Here we consider a static single-stage problem. It has been shown in...
A Characterization of Convex Problems in Decentralized Control
Decentralized Control Problems
2015/6/19
We consider the problem of constructing optimal decentralized controllers. We formulate this problem as one of minimizing the closed-loop norm of a feedback system subject to constraints on the contro...
Reduction of Decentralized Control Problems to Tractable Representations
Tractable Representations Control Problems
2015/6/19
For decentralized control problems with quadratically invariant information constraints, the optimal controller may be found efficiently. In this paper, we show that there are systems which are not qu...
While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with network diameter. We show how de...
A New Approach to Linear Filtering and Prediction Problems
A New Approach Linear Filtering Prediction Problems
2014/8/13
The classical filtering and prediction problem is re-examined using the BodeShannon representation of random processes and the “state transition” method of
analysis of dynamic systems.
A New Approach to Linear Filtering and Prediction Problems
A New Approach Linear Filtering Prediction Problems
2014/7/2
The classical filtering and prediction problem is re-examined using the Bode- Shannon representation of random processes and the “state transition” method of analysis of dynamic systems.
In this paper,the problem of minimizing a convex function subject to linear constraints is considered.An algorithm which is a combination of DFP variable metric method with generalized gradient projec...
SOME PROBLEMS OF LYAPUNOV METHOD IN LINEAR CONTINUOUS-TIME SYSTEM
Appropriate Lyapunov function Uniformly
2007/12/10
摘要 In this paper, some problems of Lyapunov method in linear continuous-time system are discussed. In part 1, some motivations are given. In part 2, in order to get a good estimate ofthe decaying time...
This paper presents a unified framework of the nonmonotone convex combinationalgorithms (such as Frank-Wolfe Algorithm) for solving the traffic assignmentproblems. Global convergence results are estab...
A MATHEMATICAL PROGRAMMING MODEL FOR THE COEXISTENCE OF COMPETITIONS AND COOPERATIONS PROBLEMS
Coexistence of competitions and cooperat
2007/8/7
We study in this paper a mathematical programming model for thecoexistence of competitions and cooperations problems. Weintroduce a new solution concept, $s$-optimal solution for theproblem, which al...
A VARIATION OF GOLDFARB'S METHOD FOR LINEARLY CONSTRAINED OPTIMIZATION PROBLEMS AND ITS SUPERLINEAR CONVERGENCE RATE
Conjugate projection superlinear conver
2007/8/7
This paper presents a variant algorithm of Goldfarb's method for linearly constrained optimization problems. In the variant algorithm, we introduce a concept called conjugate projection, which differs...