On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations a₁ Xb₁ = C₁ and a₂ Xb₂ = c₂
From MaRDI portal
(Redirected from Publication:6596589)
On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a 1 Xb 1 = C 1\) and \(a 2 Xb 2 = c 2\)
On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a 1 Xb 1 = C 1\) and \(a 2 Xb 2 = c 2\)
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A matrix LSQR iterative method to solve matrix equation AXB=C
- A new iterative algorithm for solving a class of matrix nearness problem
- An alternating direction method of multipliers for the solution of matrix equations arising in inverse problems
- An iterative algorithm for the least squares bisymmetric solutions of the matrix equations \(A_{1}XB_{1}=C_{1},A_{2}XB_{2}=C_{2}\)
- An iterative method for symmetric solutions and optimal approximation solution of the system of matrix equations \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\)
- Best approximation in inner product spaces
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Dykstra's alternating projection algorithm for two sets
- Finite element model updating in structural dynamics
- Functional Operators (AM-21), Volume 1
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Linear matrix equations from an inverse problem of vibration theory
- LSQR iterative common symmetric solutions to matrix equations AXB = E and CXD = F
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On the matrix nearness problem for (skew-)symmetric matrices associated with the matrix equations (A₁ X B₁, , A_k X B_k)=(C₁, , C_k)
- Rigorous convergence analysis of alternating variable minimization with multiplier methods for quadratic programming problems with equality constraints
- The unified frame of alternating direction method of multipliers for three classes of matrix equations arising in control theory
Cited in
(3)- Diagonal and new modified gradient-based iterative algorithms for Sylvester tensor equations
- The effective and modified Jacobi gradient based iterative algorithms for the discrete-time periodic Sylvester matrix equations
- Numerical methods for solving a class of matrix equations arising from inference for ranked set sampling on imperfect ranking
This page was built for publication: On ADMM-based methods for solving the nearness symmetric solution of the system of matrix equations \(a_1 Xb_1 = C_1\) and \(a_2 Xb_2 = c_2\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596589)
