Login / Signup
A Greedy Newton-Type Method for Multiple Sparse Constraint Problem.
Jun Sun
Lingchen Kong
Biao Qu
Published in:
J. Optim. Theory Appl. (2023)
Keyphrases
</>
experimental evaluation
significant improvement
high accuracy
computational cost
synthetic data
high precision
computational complexity
dynamic programming
model selection
detection method
data sets
objective function
pairwise
cost function
greedy algorithm
sparse matrix