Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
DOI10.1007/BF01391415zbMATH Open0531.65022MaRDI QIDQ788458FDOQ788458
Authors: Pham Dinh Tao
Publication date: 1984
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132974
Recommendations
convergenceoptimal solutionquadratic formsiterative sequencedirect and indirect methodsselfdual method
Numerical computation of matrix norms, conditioning, scaling (65F35) Norms of matrices, numerical range, applications of functional analysis to matrix theory (15A60) Quadratic and bilinear forms, inner products (15A63)
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extremal structure of convex sets. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of a subgradient method for computing the bound norm of matrices
- Title not available (Why is that?)
- Absolute and monotonic norms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comportement itératif des fonctions à multiseuil
Cited In (5)
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Computational complexity of norm-maximization
- Computing the norm ∥A∥∞,1 is NP-hard∗
- A new efficient algorithm based on DC programming and DCA for clustering
This page was built for publication: Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788458)