Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max

DOI10.1007/BF01391415MaRDI QIDQ788458zbMATH OpenFDO

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

zbMATH Keywords

convergenceoptimal solutionquadratic formsiterative sequencedirect and indirect methodsselfdual method

Mathematics Subject Classification ID

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)

Recommendations

• Global escape strategies for maximizing quadratic forms over a simplex
• On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
• Some methods for the minimization of the maximum of quadratic functions
• Maximization of sums of quotients of quadratic forms and some generalizations
• A Matrix Maximum

Cites work

• scientific article; zbMATH DE number 3425889 (Why is no real title available?)
• scientific article; zbMATH DE number 3138903 (Why is no real title available?)
• scientific article; zbMATH DE number 3163193 (Why is no real title available?)
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• scientific article; zbMATH DE number 3234861 (Why is no real title available?)
• scientific article; zbMATH DE number 3242808 (Why is no real title available?)
• scientific article; zbMATH DE number 3257775 (Why is no real title available?)
• scientific article; zbMATH DE number 3311329 (Why is no real title available?)
• scientific article; zbMATH DE number 3384182 (Why is no real title available?)
• Absolute and monotonic norms
• Comportement itératif des fonctions à multiseuil
• Convergence of a subgradient method for computing the bound norm of matrices
• Convex Analysis
• Extremal structure of convex sets. II

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)