Algorithm

Oral presentation

This is the fourth post in our series on Krylov subspaces. The previous ones (i.e Arnoldi Iterations and Lanczos Algorithm were mostly focused on eigenvalue and eigenvector computations. In this post we will have a look at solving strategies for linear systems of equations. In particular, we will derive the famous conjugate gradients algorithm. The conjugate gradients method is one of the most popular solvers for linear systems of equations. There exist countless variations and extensions.

This is the third post in my series on Krylov subspaces. The first post is here and the second one is here. The Lanczos Algorithm In this post we cover the Lanczos algorithm that gives you eigenvalues and eigenvectors of symmetric matrices. The Lanczos algorithm is named after Cornelius Lanczos, who was quite influential with his research. He also proposed an interpolation method and a method to approximate the gamma function.

This is the second post in my series on Krylov subspaces. The first post is here and the third one is here. Arnoldi Iterations Arnoldi iterations is an algorithm to find eigenvalues and eigenvectors of general matrices. The algorithm constructs orthonormal bases of suitable Krylov subspaces and extracts the eigendata from the basis representation. The method is named after the American engineer Walter Edwin Arnoldi and was published in 1951 [1].

Implementing LeNet for MNist in Wolfram Mathematica

In the previous post in our series on the Bregman algorithm we discussed how to solve convex optimization problems. In this post we want to give reference to some variations and extensions of the Bregman algorithm. First of all, there’s a website related to the Split Bregman Algorithm, which we analysed here. The website provides further documentation and reference implementations in Matlab. There is also a nice paper [1] that discusses its relationship to other frameworks in convex optimisation.

In a previous post we discussed how to solve constrained optimization problems by using the Bregman algorithm. Here we want to extend the approach unconstrained problems. Let’s start simple. Assume we want to minimize a convex and smooth function $f\colon\mathbb{R}^{n}\to\mathbb{R}$. Since $\mathbb{R}^n$ is a convex set, we can apply the Bregman algorithm from our previous post and get the following iterative scheme. $$\begin{align} x^{(n+1)} &= \arg\min_z\left\lbrace D(z, x^{(n)})\right\rbrace \\ &= \arg\min_z\left\lbrace f(z) - \left\langle \nabla f(x^{(n)}), z \right\rangle \right\rbrace \end{align}$$

In a previous post we discussed how to find a common point in a family of convex sets by using the Bregman algorithm. Actually the algorithm is capable of more. We can use it to solve constrained optimization problems. Since there is no change on the underlying algorithm, we will focus on an example here. Assume we are given a quadratic form $f(x) = x^\top Q x$ with a symmetric positive definite matrix $Q$.

In the 1960s Lev Meerovich Bregman developed an optimization algorithm [1] which became rather popular beginning of 2000s. It’s not my intention to present the proofs for all the algorithmic finesse, but rather the general ideas why it is so appealing. Some ramifications and new algorithms, that were derived from the original Bregman algorithm (e.g. [2, 3, 4]), will be presented in subsequent posts. Finding a common point in a set of convex sets Let’s assume we are given a family of convex sets $A_i$, with $i=1, \ldots, n$.

We discuss the necessary changes to our QR decomposition algorithms to handle matrices which do not have full rank.