Alternating Direction Method for a Class of Sylvester Matrix Equations with Linear Matrix Inequality Constraint

References

• D. Bertsekas and J. Tsitsiklis (1989). Parallel and Distributed Computation. Prentice Hall, Upper Saddle Rive, NJ.
   Google Scholar
• A. M. Bruckstein, M. Elad, and M. Zibulevsky (2008). On the uniqueness of nonnegative sparse solutions to underdetermined systems of equations. IEEE Trans. Inf. Theory 54(11):4813–4820.
   Web of Science ®Google Scholar
• F. Cecioni (1910). Sopra alcune operazioni algebriche sulle matrici. Annali della Scuola Normale Superiore di Pisa-Classe di Scienze 11:17–20.
   Google Scholar
• K. W. E. Chu (1987). Singular value and generalized singular value decompositions and the solution of linear matrix equations. Linear Algebra Appl. 88:83–98.
   Web of Science ®Google Scholar
• A. Dajić and J. J. Koliha (2007). Positive solutions to the equations AX = C and XB = D for Hilbert space operators. J. Math. Anal. Appl. 333(2):567–576.
   Web of Science ®Google Scholar
• J. Eckstein (1993). Nonlinear proximal point algorithms using Bregman functions, with applications to convex programming. Math. Oper. Res. 18(1):202–226.
   Web of Science ®Google Scholar
• J. Eckstein and D. Bertsekas (1992). On the Dougals-Rachford splitting method and the proximal point algorithm for maximal monotone operators, Mathematical Programming 55, North-Holland.
   Google Scholar
• M. Fortin and R. Glowinski (1983). Augmented Lagrangian methods: Applications to the numerical solution of Boundary-value problem. Studies in Mathematics & Its Applications 15(3):165–193.
   Google Scholar
• R. Glowinski and P. Le Tallec (1989). Augmented Lagrangian and operator-splitting methods in nonlinear mechanics, SIAM, Philadelphia, Pennsylvania.
   Google Scholar
• M. R. Hestenes (1969). Multiplier and gradient methods. J. Optim. Theory Appl. 4(5):303–320.
   Google Scholar
• Y. F. Ke and C. F. Ma (2014). The generalized bisymmetric (bi-skew-symmetric) solutions of a class of matrix equations and its least squares problem. Abstr. Appl. Anal. 2014:Article ID 239465, 10 pages.
   Google Scholar
• C. G. Khatri and S. K. Mitra (1976). Hermitian and nonnegative definite solutions of linear matrix equations. SIAM J. Appl. Math. 31:578–585.
   Web of Science ®Google Scholar
• F. L. Li, X. Y. Hu, and L. Zhang (2008). The generalized anti-reflexive solutions for a class of matrix equations (BX = C, XD = E). Comput. Appl. Math. 27(1):31–46.
   Web of Science ®Google Scholar
• F. L. Li, X. Y. Hu, and L. Zhang (2008). The generalized reflexive solution for a class of matrix equations (AX = B, XC = D). Acta Math. Sci. 28(1):185–193.
   Web of Science ®Google Scholar
• A. P. Liao and Y. Lei (2005). Least-squares solution with the minimum-norm for the matrix equation (AXB, GXH) = (C, D). Comput. Math. Appl. 50(3):539–550.
   Web of Science ®Google Scholar
• S. K. Mitra (1973). Common solutions to a pair of linear matrix equations A1XB1 = C1 and A2XB2 = C2. Proc. Cambridge Philos. Soc. 74:213–216.
   Web of Science ®Google Scholar
• S. K. Mitra (1984). The matrix equations AX = C, XB = D. Linear Algebra Appl. 59:171–181.
   Web of Science ®Google Scholar
• S. K. Mitra (1990). A pair of simultaneous linear matrix equations A1XB1 = C1 and A2XB2 = C2 and a programming problems. Linear Algebra Appl. 131:107–123.
   Web of Science ®Google Scholar
• A. Navarra, P. L. Odell, and D. M. Young (2001). A representation of the general common solution to the matrix equations A1XB1 = C1 and A2XB2 = C2 with applications. Comput. Math. Appl. 41:929–935.
   Web of Science ®Google Scholar
• Y. Nesterov (2004). Introductory Lectures on Convex Optimization: A Basic Course. Springer, Boston, MA.
   Google Scholar
• A. B. Ozguler and N. Akar (1991). A common solution to a pair of linear matrix equations over a principal ideal domain. Linear Algebra Appl. 144:85–99.
   Web of Science ®Google Scholar
• Z. Y. Peng, L. Wang, and J. J. Peng (2012). The solutions of matrix equation AX = B over a matrix inequality constraint. SIAM J. Matrix Anal. Appl. 33(2):554–568.
   Web of Science ®Google Scholar
• M. J. D. Powell (1969). A method for nonlinear constraints in minimization problems. Optimization 5(6):283–298.
   Google Scholar
• Y. Y. Qiu, Z. Y. Zhang, and J. F. Lu (2007). The matrix equations AX = B, XC = D with PX = sXP constraint. Appl. Math. Comput. 189(2):1428–1434.
   Web of Science ®Google Scholar
• C. R. Rao and S. K. Mitra (1971). Generalized Inverse of Matrices and its Applications. John Wiley & Sons, Inc., New York-London-Sydney.
   Google Scholar
• Y. G. Tian (2002). The minimal rank of the matrix expression A–BX–YC. Missouri J. Math. Sci. 14:40–48.
   Google Scholar
• Q. W. Wang and J. Yu (2012). Constrained solutions of a system of matrix equations. J. Appl. Math. 2012:Article ID 471573, 19 pages.
   Google Scholar
• Y. Y. Xu, W. T. Yin, Z. W. Wen, and Y. Zhang (2012). An alternating direction algorithm for matrix completion with nonnegative factors. Front. Math. China 7(2):365–384.
   Web of Science ®Google Scholar