Re: KKT constraint preconditioner
- From: toni.lassila@xxxxxxxxx (Toni Lassila)
- Date: Wed, 23 Apr 2008 14:11:31 GMT
On Wed, 23 Apr 2008 06:31:08 -0700 (PDT), laverneth@xxxxxxxxx wrote:
I want to solve a full KKT system of the form
[A C ]
[CT 0 ]
with A is a n,n matrix, and C is a n,m matrix representing m
constraints on the n primal variables,
and CT is its transpose.
I am trying to solve this method with an iterative method (namely
BiCGSTAB), and thus I need a good preconditioner.
Often, the constraint precondionner is described in the litterature
and I tried to implement it.
It involves approximate solves with the m,m system CT *C. I tried to
use a SAINV factorization on that system which has the great advantage
to avoid forming the matrix CT*C explicitly (see 1) for reference).
However, in my case C has not full column rank and Ct*C is therefore
indefinite and SAINV factorization breaks down because of exactly zero
pivots. Has anyone an idea to avoid such zero pivots in the
factorization ? Should I use an other factorization ?
Why do you have linearly dependent constraints?
.
- Follow-Ups:
- Re: KKT constraint preconditioner
- From: laverneth
- Re: KKT constraint preconditioner
- From: Gordon Sande
- Re: KKT constraint preconditioner
- References:
- KKT constraint preconditioner
- From: laverneth
- KKT constraint preconditioner
- Prev by Date: KKT constraint preconditioner
- Next by Date: Re: KKT constraint preconditioner
- Previous by thread: KKT constraint preconditioner
- Next by thread: Re: KKT constraint preconditioner
- Index(es):
Relevant Pages
|
Loading