Sparse Quadratic Optimisation over the Stiefel Manifold with Application to Permutation Synchronisation

09/30/2021
by   Florian Bernard, et al.
0

We address the non-convex optimisation problem of finding a sparse matrix on the Stiefel manifold (matrices with mutually orthogonal columns of unit length) that maximises (or minimises) a quadratic objective function. Optimisation problems on the Stiefel manifold occur for example in spectral relaxations of various combinatorial problems, such as graph matching, clustering, or permutation synchronisation. Although sparsity is a desirable property in such settings, it is mostly neglected in spectral formulations since existing solvers, e.g. based on eigenvalue decomposition, are unable to account for sparsity while at the same time maintaining global optimality guarantees. We fill this gap and propose a simple yet effective sparsity-promoting modification of the Orthogonal Iteration algorithm for finding the dominant eigenspace of a matrix. By doing so, we can guarantee that our method finds a Stiefel matrix that is globally optimal with respect to the quadratic objective function, while in addition being sparse. As a motivating application we consider the task of permutation synchronisation, which can be understood as a constrained clustering problem that has particular relevance for matching multiple images or 3D shapes in computer vision, computer graphics, and beyond. We demonstrate that the proposed approach outperforms previous methods in this domain.

READ FULL TEXT

page 8

page 15

research
07/08/2021

Adiabatic Quantum Graph Matching with Permutation Matrix Constraints

Matching problems on 3D shapes and images are challenging as they are fr...
research
09/20/2018

Towards Discrete Solution: A Sparse Preserving Method for Correspondence Problem

Many problems of interest in computer vision can be formulated as a prob...
research
11/29/2017

Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems

In this work we study convex relaxations of quadratic optimisation probl...
research
02/12/2016

Orthogonal Sparse PCA and Covariance Estimation via Procrustes Reformulation

The problem of estimating sparse eigenvectors of a symmetric matrix attr...
research
06/20/2022

Penalty Weights in QUBO Formulations: Permutation Problems

Optimisation algorithms designed to work on quantum computers or other s...
research
11/08/2018

Orthogonal Trace-Sum Maximization: Applications, Local Algorithms, and Global Optimality

This paper studies a problem of maximizing the sum of traces of matrix q...
research
10/24/2019

Convex Optimisation for Inverse Kinematics

We consider the problem of inverse kinematics (IK), where one wants to f...

Please sign up or login with your details

Forgot password? Click here to reset