A gradient-type algorithm optimizing the coupling between matrices
From MaRDI portal
Publication:935392
DOI10.1016/j.laa.2007.10.015zbMath1145.65029OpenAlexW1967198948MaRDI QIDQ935392
Catherine Fraikin, Yu. E. Nesterov, Paul Van Dooren
Publication date: 6 August 2008
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.10.015
numerical examplessingular value decompositionnumerical experimentsinner productgradient methodnon-convex optimizationcouplinggraph matchingsquare matricesisometric projections
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
A New First-Order Algorithmic Framework for Optimization Problems with Orthogonality Constraints, Some computational tools for digital archive and metadata maintenance
Cites Work
- Unnamed Item
- Unnamed Item
- Introductory lectures on convex optimization. A basic course.
- Optimizing the Coupling Between Two Isometric Projections of Matrices
- An eigendecomposition approach to weighted graph matching problems
- An Improved Algorithm for Computing the Singular Value Decomposition
- A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching