Some algorithms for maximum volume and cross approximation of symmetric semidefinite matrices

07/09/2020
by   Stefano Massei, et al.
0

Finding the r× r submatrix of maximum volume of a matrix A∈ℝ^n× n is an NP hard problem that arises in a variety of applications. We propose a new greedy algorithm of cost 𝒪(n), for the case A symmetric positive semidefinite (SPSD) and we discuss its extension to related optimization problems such as the maximum ratio of volumes. In the second part of the paper we prove that any SPSD matrix admits a cross approximation built on a principal submatrix whose approximation error is bounded by (r+1) times the error of the best rank r approximation in the nuclear norm. In the spirit of recent work by Cortinovis and Kressner we derive some deterministic algorithms which are capable to retrieve a quasi optimal cross approximation with cost 𝒪(n^3).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

02/06/2019

On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices

The problem of finding a k × k submatrix of maximum volume of a matrix A...
10/08/2019

On Polyhedral and Second-Order-Cone Decompositions of Semidefinite Optimization Problems

We study a cutting-plane method for semidefinite optimization problems (...
06/18/2017

Fixed-Rank Approximation of a Positive-Semidefinite Matrix from Streaming Data

Several important applications, such as streaming PCA and semidefinite p...
07/02/2020

Approximating Sparse Quadratic Programs

Given a matrix A ∈ℝ^n× n, we consider the problem of maximizing x^TAx su...
11/30/2020

Low rank approximation of positive semi-definite symmetric matrices using Gaussian elimination and volume sampling

Positive semi-definite matrices commonly occur as normal matrices of lea...
02/10/2021

Simple and Near-Optimal MAP Inference for Nonsymmetric DPPs

Determinantal point processes (DPPs) are widely popular probabilistic mo...
02/12/2019

Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem

We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.