TLC: Solve Truncated L1 Constrained Problem

View source: R/TLC.R

TLCR Documentation

Solve Truncated L1 Constrained Problem

Description

Using Difference Convex (DC) method to solve minimization problem with Truncated L1 Constraint.

Usage

TLC(
  Y,
  X,
  K,
  tau = 1e-05,
  tlc_weight = rep(1, ncol(X)),
  maxit_tlc = 100,
  tol_tlc = 1e-05
)

Arguments

Y

Response vector of length n.

X

Design matrix with n rows and p columns.

K

Constraint parameter in TLC.

tau

Parameter tau in TLC.

tlc_weight

Length p vector of weights corresponding to p variables, each element is either 1 (with constraint) or 0 (without constraint). Default are all 1's.

maxit_tlc

Maximum number of DC iteration.

tol_tlc

Convergence tolerance for TLC.

Value

beta: a vector of length p containing estimated coefficients.


xue-hr/TScML documentation built on Feb. 4, 2025, 12:59 a.m.