• Title/Summary/Keyword: stochastic matrices

Search Result 48, Processing Time 0.034 seconds

INDEFINITE STOCHASTIC OPTIMAL LQR CONTROL WITH CROSS TERM UNDER IQ CONSTRAINTS

  • Luo, Cheng-Xin;Feng, En-Min
    • Journal of applied mathematics & informatics
    • /
    • v.15 no.1_2
    • /
    • pp.185-200
    • /
    • 2004
  • A stochastic optimal LQR control problem under some integral quadratic (IQ) constraints is studied, with cross terms in both the cost and the constraint functionals, allowing all the control weighting matrices being indefinite. Sufficient conditions for the well-posedness of this problem are given. When these conditions are satisfied, the optimal control is explicitly derived via dual theory.

PERMANENTS OF DOUBLY STOCHASTIC KITE MATRICES

  • Hwang, Suk-Geun;Lee, Jae-Don;Park, Hong-Sun
    • Journal of the Korean Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.423-432
    • /
    • 1998
  • Let p, q be integers such that 2 $\leq$ p, q $\leq$ n, and let $D_{p, q}$ denote the matrix obtained from $I_{n}$, the identity matrix of order n, by replacing each of the first p columns by an all 1's vector and by replacing each of the first two rows and each of the last q-2 rows by an all 1's vector. In this paper the permanent minimization problem over the face, determined by the matrix $D_{p, q}$, of the polytope of all n $\times$ n doubly stochastic matrices is treated.d.

  • PDF

An application of observer to the linear stochastic contimuous systems (관측자의 선형확률연속시스템에의 적용)

  • 고명삼;홍석교
    • 전기의세계
    • /
    • v.24 no.5
    • /
    • pp.103-106
    • /
    • 1975
  • This Paper deals with an applicatoin of Luenberger Observer to the Linear Stochastic Systems. The basic technique is the use of a matrix version of the Maximum Principle of Pontryagin coupled with the use of gradient matrices to derive the gain matix for minimum error covariance. The optimal observer which is derived turns out to be identical to the well-known Kalman-Bucy Filter.

  • PDF

STOCHASTIC GRADIENT METHODS FOR L2-WASSERSTEIN LEAST SQUARES PROBLEM OF GAUSSIAN MEASURES

  • YUN, SANGWOON;SUN, XIANG;CHOI, JUNG-IL
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.25 no.4
    • /
    • pp.162-172
    • /
    • 2021
  • This paper proposes stochastic methods to find an approximate solution for the L2-Wasserstein least squares problem of Gaussian measures. The variable for the problem is in a set of positive definite matrices. The first proposed stochastic method is a type of classical stochastic gradient methods combined with projection and the second one is a type of variance reduced methods with projection. Their global convergence are analyzed by using the framework of proximal stochastic gradient methods. The convergence of the classical stochastic gradient method combined with projection is established by using diminishing learning rate rule in which the learning rate decreases as the epoch increases but that of the variance reduced method with projection can be established by using constant learning rate. The numerical results show that the present algorithms with a proper learning rate outperforms a gradient projection method.

A STOCHASTIC VARIANCE REDUCTION METHOD FOR PCA BY AN EXACT PENALTY APPROACH

  • Jung, Yoon Mo;Lee, Jae Hwa;Yun, Sangwoon
    • Bulletin of the Korean Mathematical Society
    • /
    • v.55 no.4
    • /
    • pp.1303-1315
    • /
    • 2018
  • For principal component analysis (PCA) to efficiently analyze large scale matrices, it is crucial to find a few singular vectors in cheaper computational cost and under lower memory requirement. To compute those in a fast and robust way, we propose a new stochastic method. Especially, we adopt the stochastic variance reduced gradient (SVRG) method [11] to avoid asymptotically slow convergence in stochastic gradient descent methods. For that purpose, we reformulate the PCA problem as a unconstrained optimization problem using a quadratic penalty. In general, increasing the penalty parameter to infinity is needed for the equivalence of the two problems. However, in this case, exact penalization is guaranteed by applying the analysis in [24]. We establish the convergence rate of the proposed method to a stationary point and numerical experiments illustrate the validity and efficiency of the proposed method.

ON THE MINIMUM PERMANENTS RELATED WITH CERTAIN BARYCENTRIC MATRICES

  • Song, Seok-Zun;Hong, Sung-Min;Jun, Young-Bae;Kim, Hong-Kee;Kim, Seon-Jeong
    • Journal of the Korean Mathematical Society
    • /
    • v.34 no.4
    • /
    • pp.825-839
    • /
    • 1997
  • The permanent function on certain faces of the polytope of doubly stochastic matrices are studied. These faces are shown to be barycentric, and the minimum values of permanent are determined.

  • PDF