Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method
From MaRDI portal
Publication:447558
DOI10.1155/2012/357954zbMath1246.65095OpenAlexW2016668604WikidataQ58698822 ScholiaQ58698822MaRDI QIDQ447558
J. Herrera, D. Rodríguez-Gómez
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
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- A class of linearized proximal alternating direction methods
- An improved prediction-correction method for monotone variational inequalities with separable operators
- Computing a nearest symmetric positive semidefinite matrix
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming
- Solving a class of linear projection equations
- A new method for a class of linear variational inequalities
- A class of projection and contraction methods for monotone variational inequalities
- Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
- Matrix Nearness Problems with Bregman Divergences
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- An Efficient Algorithm for Minimizing a Sum of p-Norms
- Least-Squares Covariance Matrix Adjustment
- On the basic theorem of complementarity
- Public Key Cryptography – PKC 2004
