Matrix p-Norms are NP-Hard to approximate if pne; 1, 2,∞

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 5, 2010, Pages 2802-2812

  Hendrickx, Julien M ^a,b   Olshevsky, Alex ^a,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^c Princeton University   (United States)

Author keywords

Complexity; Matrix norms; NP hardness

Indexed keywords

COMPLEXITY; MATRIX NORMS; MATRIX P; MIXED-NORM; NP-HARD; NP-HARDNESS; POLYNOMIAL-TIME ALGORITHMS;

ALGORITHMS; POLYNOMIAL APPROXIMATION;

HARDNESS;

EID: 79251470109     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/09076773X     Document Type: Article

References (5)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
2. J. Håstad, Some optimal inapproximability results, J. ACM, 48 (2001), pp. 798-859.
3. K. G. Murty and S. N. Kabadi, Some NP-complete problems in quadratic and nonlinear programming, Math. Program., 39 (1987), pp. 117-129.
4. J. Rohn, Computing the norm A∞,,1 is NP-hard, Linear Multilinear Algebra, 47 (2000), pp. 195-204.
5. D. Steinberg, Computation of Matrix Norms with Applications to Robust Optimization, M.Sc. thesis, Technion-Israel Institute of Technology, Haifa, Israel, 2005, also available online from http://www2.isye.gatech.edu/?nemirovs/ Daureen.pdf.