Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
Summary: Let \(S\) be a closed convex set of matrices and \(C\) be a given matrix. The matrix nearness problem considered in this paper is to find a matrix \(X\) in the set \(S\) at which max \(\{|x_{ij} - c_{ij}|\}\) reaches its minimum value. In order to solve the matrix nearness problem, the problem is reformulated to a min-max problem firstly, then the relationship between the min-max problem and a monotone linear variational inequality (LVI) is built. Since the matrix in the LVI problem has a special structure, a projection and contraction method is suggested to solve this LVI problem. Moreover, some implementing details of the method are presented in this paper. Finally, preliminary numerical results are reported, which show that this simple algorithm is promising for this matrix nearness problem.
- Solving a class of matrix minimization problems by linear variational inequality approaches
- A matrix nearness problem related to iterative methods
- The best approximation of matrices under inequality constraints
- scientific article; zbMATH DE number 4115838
- A new iterative algorithm for solving a class of matrix nearness problem
- A class of linearized proximal alternating direction methods
- A class of projection and contraction methods for monotone variational inequalities
- A new method for a class of linear variational inequalities
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An improved prediction-correction method for monotone variational inequalities with separable operators
- Computing a nearest symmetric positive semidefinite matrix
- Computing the nearest correlation matrix--a problem from finance
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- scientific article; zbMATH DE number 844464 (Why is no real title available?)
- Least-Squares Covariance Matrix Adjustment
- Matrix Nearness Problems with Bregman Divergences
- On the basic theorem of complementarity
- Public Key Cryptography – PKC 2004
- Solving a class of linear projection equations
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix
- Estimating high-dimensional covariance and precision matrices under general missing dependence
- A matrix nearness problem related to iterative methods
- Some matrix nearness problems suggested by Tikhonov regularization
- scientific article; zbMATH DE number 4115838 (Why is no real title available?)
- Generalized Matrix Nearness Problems
This page was built for publication: Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q447558)
