TACGP_Solver: T-ACGP Solver

TACGP_SolverR Documentation

T-ACGP Solver

Description

Terminating Approximate Conjugate Gradient Pursuit (T-ACGP) solver. Inherits all common methods from TSolver_Base.

Super class

TSolver_Base -> TACGP_Solver

Methods

Public methods

Inherited methods

TACGP_Solver$new()

Create a new TACGP_Solver.

Usage
TACGP_Solver$new(X, D, y, options = tsolver_options())
Arguments
X

Numeric matrix of predictors in memory, or mmap_matrix (the handle of a memory-mapped file).

D

Numeric matrix of dummies in memory, or mmap_matrix (the handle of a memory-mapped file).

y

Numeric response vector.

options

Solver options from tsolver_options (default: tsolver_options()).


TACGP_Solver$clone()

The objects of this class are cloneable with this method.

Usage
TACGP_Solver$clone(deep = FALSE)
Arguments
deep

Whether to make a deep clone.

References

T. Blumensath and M. E. Davies, "Gradient Pursuits," IEEE Trans. Signal Process., vol. 56, no. 6, pp. 2370-2382, 2008.

F. Scheidt and M. Muma, "Terminating Greedy Pursuits for High-Dimensional False Discovery Rate Control," in Proc. Eur. Signal Process. Conf. (EUSIPCO), 2026, pp. 2511-2515.

See Also

Other T-solvers: TAFS_Solver, TCDENET_Solver, TCDIENET_Solver, TCDLASSO_Solver, TCDTIKNET_Solver, TENETAug_Solver, TENET_Solver, TGP_Solver, TIENETAug_Solver, TIENET_Solver, TIKNET_Solver, TLARS_Solver, TLASSO_Solver, TMP_Solver, TNCGMP_Solver, TOMP_Solver, TOOLS_Solver, TSTAGEWISE_Solver, TSTEPWISE_Solver, tsolver_options()

Examples

set.seed(1)
n <- 20; p <- 5
X <- matrix(rnorm(n * p), n, p)
D <- matrix(rnorm(n * p), n, p)
y <- X[, 1] * 2 + rnorm(n)
solver <- TACGP_Solver$new(X, D, y)
solver$execute_step(T_stop = 3)
solver$get_beta()


TRexSelector documentation built on Nov. 20, 2026, 5:09 p.m.