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

DOI10.1080/01630563.2017.1349795zbMath1392.65058OpenAlexW2724330217MaRDI QIDQ4639200

Yi-Fen Ke, Chang-Feng Ma

Publication date: 3 May 2018

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630563.2017.1349795

zbMATH Keywords

convergence analysisnumerical experimentalternating direction methodSylvester matrix equationslinear matrix inequality constraint

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Iterative numerical methods for linear systems (65F10)

Related Items (4)

Generalized conjugate direction algorithm for solving generalized coupled Sylvester transpose matrix equations over reflexive or anti-reflexive matrices ⋮ The least-squares solution with the least norm to a system of tensor equations over the quaternion algebra ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ An iterative algorithm for generalized periodic multiple coupled Sylvester matrix equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An alternating direction algorithm for matrix completion with nonnegative factors
• The matrix equations \(AX=C\), \(XB=D\)
• Least-squares solution with the minimum-norm for the matrix equation \((A\times B,G\times H) = (C,D)\)
• A pair of simultaneous linear matrix equations \(A_ 1XB_ 1=C_ 1,A_ 2XB_ 2=C_ 2\) and a matrix programming problem
• The generalized reflexive solution for a class of matrix equations \( (AX=B, XC=D)\)
• The generalized anti-reflexive solutions for a class of matrix equations \((BX=C,XD=E)\)
• Singular value and generalized singular value decompositions and the solution of linear matrix equations
• The minimal rank of the matrix expression \(A-BX-YC\)
• Introductory lectures on convex optimization. A basic course.
• The generalized bisymmetric (bi-skew-symmetric) solutions of a class of matrix equations and its least squares problem
• Constrained solutions of a system of matrix equations
• Positive solutions to the equations \(AX=C\) and \(XB=D\) for Hilbert space operators
• The matrix equations \(AX=B, XC=D\) with \(PX= sXP\) constraint
• Multiplier and gradient methods
• A common solution to a pair of linear matrix equations over a principal ideal domain
• The Solutions of Matrix Equation $AX=B$ Over a Matrix Inequality Constraint
• On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations
• Hermitian and Nonnegative Definite Solutions of Linear Matrix Equations
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• A representation of the general common solution to the matrix equations \(A_1XB_1=C_1\) and \(A_2XB_2=C_2\) with applications

This page was built for publication: Alternating Direction Method for a Class of Sylvester Matrix Equations with Linear Matrix Inequality Constraint