Abstract
We show that indefinitely preconditioned symmetric Krylov-subspace methods are very efficient for solving linearized KKT systems arising in equality constrained optimization. We give a numerical comparison of various Krylov subspace methods in three different forms (original system, null-space transformation, range-space transformation). Furthermore, we give a survey of our previous results concerning indefinite preconditioners and merit functions and prove new propositions.