Algorithmes de calcul du maximum des formes quadratiques sur la boule unité de la norme du max
Some direct and indirect methods are studied for computing \(Max\{x^ tAx,\phi_{\infty}(x)\leq 1\}\). Direct methods are constructed using particular properties of \(\phi_ 1,\phi_ 2,\phi_{\infty}\) norms. These methods are very simple, but uniquely suitable to certain families of matrices. The indirect method is the selfdual method, introduced by the author [Iterative methods for computing the bound norm of matrices. (Linear Alg. and Its Appl.; to appear) and Contribution à la théorie de normes et ses applications à l'analyse numérique. Doctoral thesis (1981). Université Scientifique et Médicale de Grenoble.] with \(\phi =\phi_ 1\). In this case the problem of choosing an initial vector so that convergence of the iterative sequence occurs to an optimal solution is largely discussed.
- 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
- 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?)
- Global escape strategies for maximizing quadratic forms over a simplex
- 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
- A new efficient algorithm based on DC programming and DCA for clustering
- Computing the norm ∥A∥∞,1 is NP-hard∗
- Computational complexity of norm-maximization
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)