An efficient method for solving a matrix least squares problem over a matrix inequality constraint
From MaRDI portal
(Redirected from Publication:5963678)
Recommendations
- A class of linear constrained matrix inequality and its least squares problem
- A new algorithm for constrained matrix least squares approximations
- Least squares symmetric solutions to a matrix equation with a matrix inequality constraint
- An iterative method for the least squares solutions of the linear matrix equations with some constraint
- Solving linearly constrained matrix least squares problem by LSQR
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- scientific article; zbMATH DE number 6263059
- An iterative method for a different constrained least square solution of linear matrix equations
- Augmented Lagrangian method for matrix equation least-squares problem under a matrix inequality constraint
- Algorithm for inequality-constrained least squares problems
Cites work
- A Constrained Procrustes Problem
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- A new inexact alternating directions method for monotone variational inequalities
- Alternating direction method for covariance selection models
- Alternating direction method for image inpainting in wavelet domains
- An inexact alternating direction method for solving a class of structured variational inequalities
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- Applications of the alternating direction method of multipliers to the semidefinite inverse quadratic eigenvalue problem with a partial eigenstructure
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- Convex constrained optimization for large-scale generalized Sylvester equations
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Inexact alternating direction methods for image recovery
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Inexact implicit methods for monotone general variational inequalities
- Inverse eigenproblems and associated approximation problems for matrices with generalized symmetry or skew symmetry.
- LSQR iterative method for generalized coupled Sylvester matrix equations
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint
- Minimization problems for \((R,S)\)-symmetric and \((R,S)\)-skew symmetric matrices
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
- On the symmetric solutions of a linear matrix equation
- Solutions of symmetry-constrained least-squares problems
- The Inverse Eigenproblem of Centrosymmetric Matrices with a Submatrix Constraint and Its Approximation
- The Re-nonnegative definite solutions to the matrix inverse problem \(AX=B\)
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- The reflexive and anti-reflexive solutions of the matrix equation \(AX=B\).
- The skew-symmetric orthogonal solutions of the matrix equation AX=B
- The solutions of matrix equation AX=B over a matrix inequality constraint
- The symmetric Procrustes problem
Cited in
(21)- An iteration method to solve multiple constrained least squares problems
- Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
- An efficient iterative method for solving a class of constrained tensor least squares problem
- scientific article; zbMATH DE number 26305 (Why is no real title available?)
- Structure Preserving Quaternion Biconjugate Gradient Method
- Tensor form of GPBiCG algorithm for solving the generalized Sylvester quaternion tensor equations
- The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint
- The inexact fixed matrix iteration for solving large linear inequalities in a least squares sense
- A class of linear constrained matrix inequality and its least squares problem
- A randomized achlioptas block residual steepest descent method for large sparse overdetermined linear systems
- A new approximation algorithm for solving generalized Lyapunov matrix equations
- QQMR: a structure preserving quaternion quasi-minimal residual method
- Conditional gradient algorithm for solving operator equation least squares problem under the bound constraints
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- Solving the least squares method problem in the AHP for \(3 \times 3\) and \(4\times 4\) matrices
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint
- Algorithm for inequality-constrained least squares problems
- Augmented Lagrangian method for matrix equation least-squares problem under a matrix inequality constraint
- Iterative solutions of generalized Sylvester quaternion tensor equations
This page was built for publication: An efficient method for solving a matrix least squares problem over a matrix inequality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963678)
