Integral Methods for Quadratic Programming: Theory and Implementation

Yves Brise

ISBN 978-3-8325-3366-3
232 Seiten, Erscheinungsjahr: 2013
Preis: 45.50 €
This PhD thesis was written at ETH Zürich, in Prof. Dr. Emo Welzl's research group, under the supervision of Dr. Bernd Gärnter. It shows two theoretical results that are both related to quadratic programming.

The first one concerns the abstract optimization framework of violator spaces and the randomized procedure called Clarkson's algorithm. In a nutshell, the algorithm randomly samples from a set of constraints, computes an optimal solution subject to these constraints, and then checks whether the ignored constraints violate the solution. If not, some form of re-sampling occurs. We present the algorithm in the easiest version that can still be analyzed successfully.

The second contribution concerns quadratic programming more directly. It is well-known that a simplex-like procedure can be applied to quadratic programming. The main computational effort in this algorithm comes from solving a series of linear equation systems that change gradually. We develop the integral LU decomposition of matrices, which allows us to solve the equation systems efficiently and to exploit sparse inputs.

Last but not least, a considerable portion of the work included in this thesis was devoted to implementing the integral LU decomposition in the framework of the existing quadratic programming solver in the Computational Geometry Algorithms Library (CGAL). In the last two chapters we describe our implementation and the experimental results we obtained.

  • Quadratisches Programm
  • Quadratic Program
  • Konvexe Optimierung
  • Convex Optimization
  • Abstrakte Optimierungsverfahren
  • Abstract Optimization Frameworks
  • Matrixzerlegungen
  • Matrix Factorizations
  • Dünne Matrizen
  • Sparse Matrices


45.50 €
Versandkostenfrei innerhalb Deutschlands

Wollen auch Sie Ihre Dissertation veröffentlichen?