Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
From MaRDI portal
Publication:447558
DOI10.1155/2012/357954zbMATH Open1246.65095DBLPjournals/advor/XuS12OpenAlexW2016668604WikidataQ58698822 ScholiaQ58698822MaRDI QIDQ447558FDOQ447558
Publication date: 4 September 2012
Published in: Advances in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/357954
Recommendations
- 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
Cites Work
- Computing the nearest correlation matrix--a problem from finance
- Alternating direction algorithms for \(\ell_1\)-problems in compressive sensing
- Computing a nearest symmetric positive semidefinite matrix
- Title not available (Why is that?)
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- A class of projection and contraction methods for monotone variational inequalities
- A new method for a class of linear variational inequalities
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Title not available (Why is that?)
- On the basic theorem of complementarity
- A class of linearized proximal alternating direction methods
- Matrix Nearness Problems with Bregman Divergences
- Least-Squares Covariance Matrix Adjustment
- Solving a class of linear projection equations
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Public Key Cryptography – PKC 2004
- An improved prediction-correction method for monotone variational inequalities with separable operators
Cited In (6)
- Title not available (Why is that?)
- Selective alternating projections to find the nearest SDD\(^{+}\) matrix
- Some matrix nearness problems suggested by Tikhonov regularization
- Generalized Matrix Nearness Problems
- Estimating high-dimensional covariance and precision matrices under general missing dependence
- A matrix nearness problem related to iterative methods
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)
