solve_modified_cholesky Subroutine

private subroutine solve_modified_cholesky(H, b, x)

solve_modified_cholesky

Description

Solve with a modified Cholesky factorisation after Murray (1972), Sec. 4.9, with the choice of from Gill and Murray (1974).

The matrix is factorised by columns as , where is a non-negative diagonal matrix and the off-diagonal elements of are bounded by (Murray 1972, Eqs. 4.9.7-4.9.12). Each pivot is taken in absolute value and floored at ; a column whose largest element exceeds is rescaled. If is sufficiently positive definite then and the step is the pure Newton step.

Deviation from Murray (1972): Eq. 4.9.16 gives . Here (Gill and Murray 1974), with and . With the original choice, an indefinite matrix such as gives a nearly singular and a step of order .

Arguments

Type IntentOptional Attributes Name
real(kind=pr), intent(in) :: H(:,:)

Hessian

real(kind=pr), intent(in) :: b(:)

Right-hand side

real(kind=pr), intent(out) :: x(:)

Variable vector


Called by

proc~~solve_modified_cholesky~~CalledByGraph proc~solve_modified_cholesky solve_modified_cholesky proc~flash_second_order flash_second_order proc~flash_second_order->proc~solve_modified_cholesky

Variables

Type Visibility Attributes Name Initial
real(kind=pr), private :: Lb(size(H,1),size(H,1))
real(kind=pr), private :: beta

Bound on the elements of the modified factor.

real(kind=pr), private :: delta

Diagonal floor .

real(kind=pr), private :: gamma
integer, private :: i

Loop index i.

integer, private :: j

Loop index j.

real(kind=pr), private :: lh
real(kind=pr), private :: lj(size(H,1))
integer, private :: n
real(kind=pr), private :: theta
real(kind=pr), private :: xi
real(kind=pr), private :: y(size(H,1))

Forward-substitution intermediate .