• Title/Summary/Keyword: Semidefinite Linear Complementarity Problems (SDLCP)

Search Result 4, Processing Time 0.019 seconds

POLYNOMIAL CONVERGENCE OF PREDICTOR-CORRECTOR ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang;Xiang, Ruiyin
    • Journal of applied mathematics & informatics
    • /
    • v.29 no.5_6
    • /
    • pp.1285-1293
    • /
    • 2011
  • We establishes the polynomial convergence of a new class of path-following methods for semidefinite linear complementarity problems (SDLCP) whose search directions belong to the class of directions introduced by Monteiro [9]. Namely, we show that the polynomial iteration-complexity bound of the well known algorithms for linear programming, namely the predictor-corrector algorithm of Mizuno and Ye, carry over to the context of SDLCP.

POLYNOMIAL CONVERGENCE OF PRIMAL-DUAL ALGORITHMS FOR SDLCP BASED ON THE M-Z FAMILY OF DIRECTIONS

  • Chen, Feixiang
    • Journal of applied mathematics & informatics
    • /
    • v.30 no.1_2
    • /
    • pp.127-133
    • /
    • 2012
  • We establish the polynomial convergence of a new class of path-following methods for SDLCP whose search directions belong to the class of directions introduced by Monteiro [3]. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely the short-step path-following algorithm of Kojima et al. and Monteiro and Alder, carry over to the context of SDLCP.

ON POSITIVE SEMIDEFINITE PRESERVING STEIN TRANSFORMATION

  • Song, Yoon J.
    • Journal of applied mathematics & informatics
    • /
    • v.33 no.1_2
    • /
    • pp.229-234
    • /
    • 2015
  • In the setting of semidefinite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X):=X-AXA^T$ for $A{\in}R^{n{\times}n}$ that is positive semidefinite preserving (i.e., $S_A(S^n_+){\subseteq}S^n_+$) and show that such transformation is strictly monotone if and only if it is nondegenerate. We also show that a positive semidefinite preserving $S_A$ has the Ultra-GUS property if and only if $1{\not\in}{\sigma}(A){\sigma}(A)$.

ON STEIN TRANSFORMATION IN SEMIDEFINITE LINEAR COMPLEMENTARITY PROBLEMS

  • Song, Yoon J.;Shin, Seon Ho
    • Journal of applied mathematics & informatics
    • /
    • v.32 no.1_2
    • /
    • pp.285-295
    • /
    • 2014
  • In the setting of semidenite linear complementarity problems on $S^n$, we focus on the Stein Transformation $S_A(X)\;:=X-AXA^T$, and show that $S_A$ is (strictly) monotone if and only if ${\nu}_r(UAU^T{\circ}\;UAU^T)$(<)${\leq}1$, for all orthogonal matrices U where ${\circ}$ is the Hadamard product and ${\nu}_r$ is the real numerical radius. In particular, we show that if ${\rho}(A)$ < 1 and ${\nu}_r(UAU^T{\circ}\;UAU^T){\leq}1$, then SDLCP($S_A$, Q) has a unique solution for all $Q{\in}S^n$. In an attempt to characterize the GUS-property of a nonmonotone $S_A$, we give an instance of a nonnormal $2{\times}2$ matrix A such that SDLCP($S_A$, Q) has a unique solution for Q either a diagonal or a symmetric positive or negative semidenite matrix. We show that this particular $S_A$ has the $P^{\prime}_2$-property.