@misc{LuceDuintjerTebbensLiesenetal., author = {Luce, Robert and Duintjer Tebbens, Jurjen and Liesen, J{\"o}rg and Nabben, Robert and Gr{\"o}tschel, Martin and Koch, Thorsten and Schenk, Olaf}, title = {On the Factorization of Simplex Basis Matrices}, organization = {TU Berlin, Zuse Institute Berlin, University of Basel}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11392}, number = {09-24}, abstract = {In the simplex algorithm, solving linear systems with the basis matrix and its transpose accounts for a large part of the total computation time. We investigate various methods from modern numerical linear algebra to improve the computation speed of the basis updates arising in LPs. The experiments are executed on a large real-world test set. The most widely used solution technique is sparse LU factorization, paired with an updating scheme that allows to use the factors over several iterations. Clearly, small number of fill-in elements in the LU factors is critical for the overall performance. Using a wide range of LPs we show numerically that after a simple permutation the non-triangular part of the basis matrix is so small, that the whole matrix can be factorized with (relative) fill-in close to the optimum. This permutation has been exploited by simplex practitioners for many years. But to our knowledge no systematic numerical study has been published that demonstrates the effective reduction to a surprisingly small non-triangular problem, even for large scale LPs. For the factorization of the non-triangular part most existing simplex codes use some variant of dynamic Markowitz pivoting, which originated in the late 1950s. We also show numerically that, in terms of fill-in and in the simplex context, dynamic Markowitz is quite consistently superior to other, more recently developed techniques.}, language = {en} } @misc{SchenkWaechterWeiser, author = {Schenk, Olaf and W{\"a}chter, Andreas and Weiser, Martin}, title = {Inertia Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-10314}, number = {07-32}, abstract = {Fast nonlinear programming methods following the all-at-once approach usually employ Newton's method for solving linearized Karush-Kuhn-Tucker (KKT) systems. In nonconvex problems, the Newton direction is only guaranteed to be a descent direction if the Hessian of the Lagrange function is positive definite on the nullspace of the active constraints, otherwise some modifications to Newton's method are necessary. This condition can be verified using the signs of the KKT's eigenvalues (inertia), which are usually available from direct solvers for the arising linear saddle point problems. Iterative solvers are mandatory for very large-scale problems, but in general do not provide the inertia. Here we present a preconditioner based on a multilevel incomplete \$LBL^T\$ factorization, from which an approximation of the inertia can be obtained. The suitability of the heuristics for application in optimization methods is verified on an interior point method applied to the CUTE and COPS test problems, on large-scale 3D PDE-constrained optimal control problems, as well as 3D PDE-constrained optimization in biomedical cancer hyperthermia treatment planning. The efficiency of the preconditioner is demonstrated on convex and nonconvex problems with \$150^3\$ state variables and \$150^2\$ control variables, both subject to bound constraints.}, language = {en} }