Refining the lower bound on the positive eigenvalues of saddle point matrices with insights on the interactions between the blocks - IRIT - Institut de Recherche en Informatique de Toulouse Accéder directement au contenu
Article Dans Une Revue SIAM Journal on Matrix Analysis and Applications Année : 2018

Refining the lower bound on the positive eigenvalues of saddle point matrices with insights on the interactions between the blocks

Résumé

Efficiently solving saddle point systems like Karush–Kuhn–Tucker (KKT) systems is crucial for many algorithms in constrained nonlinear continuous optimization. Such systems can be very ill conditioned, in particular when the (1,1) block has few very small eigenvalues (see Rusten and Winther [SIAM J. Matrix Anal. Appl., 13 (1992), pp. 887–904]). However, it is commonly observed that despite these small eigenvalues, some sort of interaction between this (1,1) block and the (1,2) block actually occurs that may influence strongly the convergence of Krylov subspace methods like Minres. In this paper, we highlight some aspects of this interaction. We illustrate in particular, with some examples, how and in which circumstances the convergence of Minres might be affected by these few very small eigenvalues in the (1,1) block. We further derive theoretically a tighter lower bound on the positive eigenvalues of saddle point matrices of the KKT form.
Fichier principal
Vignette du fichier
ruiz_22364.pdf (457.99 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-02348261 , version 1 (05-11-2019)

Identifiants

Citer

Daniel Ruiz, Annick Sartenaer, Charlotte Tannier. Refining the lower bound on the positive eigenvalues of saddle point matrices with insights on the interactions between the blocks. SIAM Journal on Matrix Analysis and Applications, 2018, 39 (2), pp.712-736. ⟨10.1137/16M108152X⟩. ⟨hal-02348261⟩
36 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More