• Title/Summary/Keyword: Positive definite solution

Search Result 31, Processing Time 0.036 seconds

POSITIVE SOLUTIONS FOR A NONLINEAR MATRIX EQUATION USING FIXED POINT RESULTS IN EXTENDED BRANCIARI b-DISTANCE SPACES

  • Reena, Jain;Hemant Kumar, Nashine;J.K., Kim
    • Nonlinear Functional Analysis and Applications
    • /
    • v.27 no.4
    • /
    • pp.709-730
    • /
    • 2022
  • We consider the nonlinear matrix equation (NMEs) of the form 𝓤 = 𝓠 + Σki=1 𝓐*iℏ(𝓤)𝓐i, where 𝓠 is n × n Hermitian positive definite matrices (HPDS), 𝓐1, 𝓐2, . . . , 𝓐m are n × n matrices, and ~ is a nonlinear self-mappings of the set of all Hermitian matrices which are continuous in the trace norm. We discuss a sufficient condition ensuring the existence of a unique positive definite solution of a given NME and demonstrate this sufficient condition for a NME 𝓤 = 𝓠 + 𝓐*1(𝓤2/900)𝓐1 + 𝓐*2(𝓤2/900)𝓐2 + 𝓐*3(𝓤2/900)𝓐3. In order to do this, we define 𝓕𝓖w-contractive conditions and derive fixed points results based on aforesaid contractive condition for a mapping in extended Branciari b-metric distance followed by two suitable examples. In addition, we introduce weak well-posed property, weak limit shadowing property and generalized Ulam-Hyers stability in the underlying space and related results.

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.

THE EXTREMAL RANKS AND INERTIAS OF THE LEAST SQUARES SOLUTIONS TO MATRIX EQUATION AX = B SUBJECT TO HERMITIAN CONSTRAINT

  • Dai, Lifang;Liang, Maolin
    • Journal of applied mathematics & informatics
    • /
    • v.31 no.3_4
    • /
    • pp.545-558
    • /
    • 2013
  • In this paper, the formulas for calculating the extremal ranks and inertias of the Hermitian least squares solutions to matrix equation AX = B are established. In particular, the necessary and sufficient conditions for the existences of the positive and nonnegative definite solutions to this matrix equation are given. Meanwhile, the least squares problem of the above matrix equation with Hermitian R-symmetric and R-skew symmetric constraints are also investigated.

Numerical Stability of Cholesky Factorization in Interior Point Methods for Linear Programming (내부점 방법에서 촐레스키 분해의 수치적 안정성)

  • Seol, Tong-Ryeol;Seong, Myeong-Ki;Ahn, Jae-Geun;Park, Soon-Dal
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.25 no.3
    • /
    • pp.290-297
    • /
    • 1999
  • In interior point methods for linear programming, we must solve a linear system with a symmetric positive definite matrix at every iteration, and Cholesky factorization is generally used to solve it. Therefore, if Cholesky factorization is not done successfully, many iterations are needed to find the optimal solution or we can not find it. We studied methods for improving the numerical stability of Cholesky factorization and the accuracy of the solution of the linear system.

  • PDF

On a Sufficient Condition of Actuator Comparability for Actuator Selection LQ Problem

  • Kuwahara, Masanori;Kawaji, Shigeyasu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.25-29
    • /
    • 2003
  • LQ actuator selection problem for multi-input system discussed in this paper is to determine optimal actuator out of many actuators and input sequences so as to minimize the quadratic control performance. The solution of this problem depends on initial values and has a combinatorial property, so it is extremely difficult to get an optimal solution. For this difficulty, we proposed the concept of comparability of actuators and showed the uniqueness of the solution[1] . Further, to get general optimal solution for LQ problem with actuator selection strategies, we derived the equivalent condition for the comparability of actuator in single-input system . In this paper we extend this result to the case of multi-input system. The derived sufficient condition is applicable in the case of positive semi-definite comparability matrices.

  • PDF

A Cholesky Decomposition of the Inverse of Covariance Matrix

  • Park, Jong-Tae;Kang, Chul
    • Journal of the Korean Data and Information Science Society
    • /
    • v.14 no.4
    • /
    • pp.1007-1012
    • /
    • 2003
  • A recursive procedure for finding the Cholesky root of the inverse of sample covariance matrix, leading to a direct solution for the inverse of a positive definite matrix, is developed using the likelihood equation for the maximum likelihood estimation of the Cholesky root under normality assumptions. An example of the Hilbert matrix is considered for an illustration of the procedure.

  • PDF

Solvability of Stochastic Discrete Algebraic Riccati Equation

  • Oh, Kyu-Kwon;Okuyama, Yoshifumi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.33.4-33
    • /
    • 2001
  • This paper considers a stochastic discrete algebraic Riccati equation, which is a generalized version of the well-known standard discrete algebraic Riccati equation, and has additional linear terms. Under controllability, observability and the assumption that the additional terms are not too large, the existence of a positive definite solution is guaranteed. It is shown that it arises in optimal control of a linear discrete-time system with multiplicative White noise and quadratic cost. A numerical example is given.

  • PDF

EXPLICIT SOLUTIONS OF INFINITE QUADRATIC PROGRAMS

  • Sivakumar, K.C.;Swarna, J.Mercy
    • Journal of applied mathematics & informatics
    • /
    • v.12 no.1_2
    • /
    • pp.211-218
    • /
    • 2003
  • Let H be a Hilbert space, X be a real Banach space, A : H \longrightarrow X be an operator with D(A) dense in H, G: H \longrightarrow H be positive definite, $\chi$ $\in$ D(A) and b $\in$ H. Consider the quadratic programming problem: QP: Minimize $\frac{1}{2}$〈p, $\chi$〉 + 〈$\chi$, G$\chi$〉 subject to A$\chi$= b In this paper, we obtain an explicit solution to the above problem using generalized inverses.

Riccati Equation Approach to $\textrm{H}_\infty$ Robust Performance Problem for Descriptor Form System

  • Shen, Tielong;Tamura, Katsutoshi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10b
    • /
    • pp.95-99
    • /
    • 1993
  • In this paper, we discuss H$_{\infty}$ robust performance problem for uncertain system described in a descriptor form. We show that the method based on Riccati equation can be extended to solve this problem. First, such a sufficient condition is given that the system described in a descriptor form is quadratic stable and H$_{\infty}$ norm of a specified transfer function is less than a given level. Using this result, a state feedback law which ensures H$_{\infty}$ robust performance of closed loop system is derived based on a positive definite solution of a Riccati equation. This result shows that a solution of the problem can be also obtained by solving H$_{\infty}$ standard problem for an extended plant. Finally, a design example and simulation results will be given.ven.

  • PDF