An efficient method for solving a matrix least squares problem over a matrix inequality constraint
From MaRDI portal
Publication:5963678
DOI10.1007/s10589-015-9783-zzbMath1332.90188OpenAlexW2171019910MaRDI QIDQ5963678
Publication date: 23 February 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9783-z
Related Items (7)
The iterative solution of a class of tensor equations via Einstein product with a tensor inequality constraint ⋮ An iteration method to solve multiple constrained least squares problems ⋮ An efficient iterative method for solving a class of constrained tensor least squares problem ⋮ Structure Preserving Quaternion Biconjugate Gradient Method ⋮ Tensor form of GPBiCG algorithm for solving the generalized Sylvester quaternion tensor equations ⋮ The least squares solution of a class of generalized Sylvester-transpose matrix equations with the norm inequality constraint ⋮ A new approximation algorithm for solving generalized Lyapunov matrix equations
Uses Software
Cites Work
- Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
- Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
- Convex constrained optimization for large-scale generalized Sylvester equations
- The skew-symmetric orthogonal solutions of the matrix equation \(AX=B\)
- LSQR iterative method for generalized coupled Sylvester matrix equations
- A Kronecker approximation with a convex constrained optimization method for blind image restoration
- On the symmetric solutions of a linear matrix equation
- The symmetric Procrustes problem
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- The reflexive and anti-reflexive solutions of the matrix equation \(AX=B\).
- Inverse eigenproblems and associated approximation problems for matrices with generalized symmetry or skew symmetry.
- A new inexact alternating directions method for monotone variational inequalities
- Inexact implicit methods for monotone general variational inequalities
- Minimization problems for \((R,S)\)-symmetric and \((R,S)\)-skew symmetric matrices
- The Re-nonnegative definite solutions to the matrix inverse problem \(AX=B\)
- On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- Conditional gradient Tikhonov method for a convex optimization problem in image restoration
- Alternating direction method for covariance selection models
- An inexact alternating direction method for solving a class of structured variational inequalities
- Applications of the alternating direction method of multipliers to the semidefinite inverse quadratic eigenvalue problem with a partial eigenstructure
- The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
- The Solutions of Matrix Equation $AX=B$ Over a Matrix Inequality Constraint
- Inexact Alternating Direction Methods for Image Recovery
- Alternating Direction Method for Image Inpainting in Wavelet Domains
- A Constrained Procrustes Problem
- Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint
- Solutions of symmetry-constrained least-squares problems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
- The Inverse Eigenproblem of Centrosymmetric Matrices with a Submatrix Constraint and Its Approximation
This page was built for publication: An efficient method for solving a matrix least squares problem over a matrix inequality constraint
