[Previous] [Next]

BARORDER

Description
Newton barrier: This specifies the ordering algorithm for the Cholesky factorization, used to preserve the sparsity of the factorized matrix.
Type
Integer
Values
0 
Choose automatically.
1 
Minimum degree method. This selects diagonal elements with the smallest number of nonzeros in their rows or columns.
2 
Minimum local fill method. This considers the adjacency graph of nonzeros in the matrix and seeks to eliminate nodes that minimize the creation of new edges.
3 
Nested dissection method. This considers the adjacency graph and recursively seeks to separate it into non-adjacent pieces.
Default value
0
Affects routines
XPRSmaxim (MAXIM), XPRSminim (MINIM).

[Previous] [Next] [Index]
If you have any comments or suggestions about these pages, please send mail to docs@dashoptimization.com.