An efficient method for solving a matrix least squares problem over a matrix inequality constraint

DOI10.1007/S10589-015-9783-ZzbMATH Open1332.90188OpenAlexW2171019910MaRDI QIDQ5963678FDOQ5963678

Jiaofen Li, Wen Li, Ru Huang

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

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

zbMATH Keywords

alternating direction methoditeration methodmatrix inequalityleast squares problemmatrix equation

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cites Work

• LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Alternating direction method for covariance selection models
• The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems
• Inexact alternating-direction-based contraction methods for separable linearly constrained convex optimization
• The symmetric Procrustes problem
• The reflexive and anti-reflexive solutions of the matrix equation \(AX=B\).
• A new inexact alternating directions method for monotone variational inequalities
• Alternating Direction Method for Image Inpainting in Wavelet Domains
• Least-squares solutions of matrix inverse problem for bi-symmetric matrices with a submatrix constraint
• The Inverse Eigenproblem of Centrosymmetric Matrices with a Submatrix Constraint and Its Approximation
• Inexact implicit methods for monotone general variational inequalities
• 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
• Inexact Alternating Direction Methods for Image Recovery
• LSQR iterative method for generalized coupled Sylvester matrix equations
• A Kronecker approximation with a convex constrained optimization method for blind image restoration
• The Re-nonnegative definite solutions to the matrix inverse problem \(AX=B\)
• Inverse eigenproblems and associated approximation problems for matrices with generalized symmetry or skew symmetry.
• Minimization problems for \((R,S)\)-symmetric and \((R,S)\)-skew symmetric matrices
• Conditional gradient Tikhonov method for a convex optimization problem in image restoration
• The solutions of matrix equation \(AX=B\) over a matrix inequality constraint
• A Constrained Procrustes Problem
• Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization
• On the symmetric solutions of a linear matrix equation
• Convex constrained optimization for large-scale generalized Sylvester equations
• The skew-symmetric orthogonal solutions of the matrix equation \(AX=B\)
• A hybrid algorithm for solving minimization problem over (R,S)-symmetric matrices with the matrix inequality constraint
• Dykstra's algorithm for constrained least-squares rectangular matrix problems
• An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
• On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
• Solutions of symmetry-constrained least-squares problems

Cited In (14)

• Title not available (Why is that?)
• 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 new approximation algorithm for solving generalized Lyapunov matrix equations
• 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
• Iterative solutions of generalized Sylvester quaternion tensor equations
• An iteration method to solve multiple constrained least squares problems
• An efficient iterative method for solving a class of constrained tensor least squares problem

Uses Software

• LSQR
• CRAIG

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)