An Efficient Solution to Structured Optimization Problems using Recursive Matrices. (14th November 2019)

• Record Type: Journal Article
• Authors: Rückert, D.; Stamminger, M.
• Is Part Of: Computer graphics forum. Volume 38:Number 8(2019)
• Page Start: 33
• Page End: 39
• Publication Date: 2019-11-14
• Subjects: CCS Concepts -- Computing methodologies → Symbolic and algebraic algorithms -- Linear algebra algorithms -- Optimization algorithms; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.13758
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: We present a linear algebra framework for structured matrices and general optimization problems. The matrices and matrix operations are defined recursively to efficiently capture complex structures and enable advanced compiler optimization. In addition to common dense and sparse matrix types, we define mixed matrices, which allow every element to be of a different type. Using mixed matrices, the low‐ and high‐level structure of complex optimization problems can be encoded in a single type. This type is then analyzed at compile time by a recursive linear solver that picks the optimal algorithm for the given problem. For common computer vision problems, our system yields a speedup of 3–5 compared to other optimization frameworks. The BLAS performance is benchmarked against the MKL library. We achieve a significant speedup in block‐SPMV and block‐SPMM. This work is implemented and released open‐source as a header‐only extension to the C+ + math library Eigen.