Solving the matrix nearness problem in the maximum norm by applying a projection and contraction method

DOI10.1155/2012/357954MaRDI QIDQ447558zbMATH OpenOpenAlexDBLPWikidataFDO

Authors M. H. Xu, H. Shao

Publication date 4 September 2012

Published in Advances in Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2012/357954

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

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

• scientific article; zbMATH DE number 4115838 (Why is no real title available?)
• scientific article; zbMATH DE number 844464 (Why is no real title available?)
• 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
• 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

Cited in

(6)

• scientific article; zbMATH DE number 4115838 (Why is no real title available?)
• 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)