Biannual Report - Fachbereich Mathematik - Technische Universität ...

device, requiring minimal knowledge of programming. Each application comes with
predefined test cases which can be used without programming knowledge at all. In
the period under review the English version became fully operable. This version has
been extended by 9 newly implemented methods and some other implementations
were completely redesigned. There were about 6000 visits in 2011 and 12000 visits
in 2012. Numawww meanwhile attracts attention internationally. For more information
see numawww.mathematik.tu-darmstadt.de
Contributor at TU Darmstadt: Peter Spellucci
ISAL1: Infeasible-Point Subgradient Algorithm for Basis Pursuit
ISAL1 is a subgradient algorithm employing adaptive approximate projections for
solving the basis pursuit problem, i.e., finding a minimum-l1-norm solution to an
underdetermined linear equation system. For more information, see http://wwwopt.
mathematik.tu-darmstadt.de/spear/
Contributor at TU Darmstadt: Andreas M. Tillmann
L1-Testset: A set of test instances for L1-Minimization
L1-Testset consists of 548 basis pursuit instances consisting of the constraint data
(matrix and right hand side vector), a known unique optimal solution, and various
data-specific parameters, constructed for the purpose of a unified solver comparison
for basis pursuit problems. For more information, see http://wwwopt.mathematik.
tu-darmstadt.de/spear/
Contributor at TU Darmstadt: Andreas M. Tillmann
ipfilter: An NLP Solver based on a primal-dual interior-point filter algorithm
ipfilter is a state-of-the-art solver for nonlinear programming problems (defined by
the minimization of an objective function in a feasible region defined by equality and
inequality constraints).
See http://www.mat.uc.pt/ipfilter/
Contributor at TU Darmstadt: Stefan Ulbrich
138 3 Publications