Computational Optimization and Applications

, Volume 36, Issue 2, pp 321–341

Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization

Article

DOI: 10.1007/s10589-006-9003-y

Cite this article as:
Schenk, O., Wächter, A. & Hagemann, M. Comput Optim Appl (2007) 36: 321. doi:10.1007/s10589-006-9003-y

Abstract

Interior-point methods are among the most efficient approaches for solving large-scale nonlinear programming problems. At the core of these methods, highly ill-conditioned symmetric saddle-point problems have to be solved. We present combinatorial methods to preprocess these matrices in order to establish more favorable numerical properties for the subsequent factorization. Our approach is based on symmetric weighted matchings and is used in a sparse direct LDLT factorization method where the pivoting is restricted to static supernode data structures. In addition, we will dynamically expand the supernode data structure in cases where additional fill-in helps to select better numerical pivot elements. This technique can be seen as an alternative to the more traditional threshold pivoting techniques. We demonstrate the competitiveness of this approach within an interior-point method on a large set of test problems from the CUTE and COPS sets, as well as large optimal control problems based on partial differential equations. The largest nonlinear optimization problem solved has more than 12 million variables and 6 million constraints.

Keywords

Nonconvex nonlinear programming Interior-point method Saddle-point problem Numerical linear algebra Maximum weight matching 

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  • Olaf Schenk
    • 1
  • Andreas Wächter
    • 2
  • Michael Hagemann
    • 1
  1. 1.Departement of Computer ScienceUniversity of BaselBaselSwitzerland
  2. 2.IBM T.J. Watson Research CenterYorktown HeightsUSA