| .active_set_refine_woodbury | R Documentation |
Uses the same add/drop active-set logic as .active_set_refine(),
but solves each equality-constrained subproblem through the
Woodbury-corrected Lagrangian projection rather than the plain
block-diagonal projection.
.active_set_refine_woodbury(
result,
K,
p_expansions,
A,
R_constraints,
constraint_value_vectors,
family,
qp_Amat,
qp_bvec,
qp_meq,
rhs_list,
Ghalf_corrected,
wb_sqrt,
parallel_aga,
parallel_matmult,
cl,
chunk_size,
num_chunks,
rem_chunks,
tol,
parallel_qr = FALSE,
max_as_iter = NULL,
initial_active_ineq = integer(0)
)
result |
List of current coefficient column vectors. |
K, p_expansions |
Integer dimensions. |
A |
Original equality constraint matrix. |
R_constraints |
Number of columns of |
constraint_value_vectors |
Constraint RHS list. |
family |
GLM family object. |
qp_Amat, qp_bvec, qp_meq |
Inequality specification. |
rhs_list |
List of partition-wise right-hand-side vectors on the
original coefficient scale. Gaussian GEE passes
|
Ghalf_corrected |
List of corrected
|
wb_sqrt |
Output of |
parallel_aga, parallel_matmult |
Logical flags. |
cl, chunk_size, num_chunks, rem_chunks |
Parallel parameters. |
tol |
Convergence tolerance. |
max_as_iter |
Maximum active-set iterations (default 50). |
initial_active_ineq |
Integer vector of inequality columns used as the initial working set. |
Same structure as .active_set_refine().
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.