Projets par an
Résumé
The computational problem of determining the projection of a given symmetric matrix onto the subspace of symmetric matrices that have a fixed sparsity pattern is considered. This projection is performed with respect to a weighted Frobenius norm involving a metric that is not diagonal. It is shown that the solution to this question is computationally feasible when the metric appearing in the norm is a low rank modification to the identity. Also, generalization to perturbations of higher rank is shown to be increasingly costly in terms of computation.
langue originale | Anglais |
---|---|
Pages (de - à) | 125-129 |
Nombre de pages | 5 |
journal | Mathematical Programming |
Volume | 25 |
Numéro de publication | 1 |
Etat de la publication | Publié - 1 janv. 1983 |
Empreinte digitale
Examiner les sujets de recherche de « Forcing Sparsity By Projecting With Respect To A Non-Diagonally-Weighted Frobenius Norm. ». Ensemble, ils forment une empreinte digitale unique.Projets
- 1 Actif
-
ADALGOPT: ADALGOPT - Algorithmes avancés en optimisation non-linéaire
1/01/87 → …
Projet: Axe de recherche