No article text was recorded for this version.
active-set optimization
Version 2 of 2202 papers277 conceptsfrozen 2026-10-04
Papers in this version
- Blog: A Fast Active Set Block Coordinate Descent Algorithm for ℓ1-Regularized Least Squares
- Blog: Accelerating ISTA with an active set strategy
- Blog: Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding
- Blog: Projection free methods on product domains
- Blog: Projection free methods on product domains
- Blog: Minimization over the l1-ball using an active-set non-monotone projected gradient
- Blog: Coordinate descent optimization for <i>l</i><SUP>1</SUP> minimization with application to compressed sensing; a greedy algorithm
- Blog: Fast Sparse Gaussian Markov Random Fields Learning Based on Cholesky Factorization
- Blog: Efficient L1 Regularized Logistic Regression
- Blog: An active-set method for sparse approximations. Part I: Separable $\ell_1$ terms
- Blog: Minimization over the ℓ 1-ball using an active-set non-monotone projected gradient
- Blog: Parametric Simplex Method for Sparse Learning
- Blog: An Efficient Active Set Algorithm for Covariance Based Joint Data and Activity Detection for Massive Random Access with Massive MIMO
- Blog: Dual-Augmented Lagrangian Method for Efficient Sparse Reconstruction
- Blog: Sparse Inverse Covariance Estimation via an Adaptive Gradient-Based Method
- Blog: The fastest $\ell_{1,\infty}$ prox in the west
- Blog: A Fast Algorithm for Sparse Controller Design
- Blog: LARGE SCALE SPARSE OPTIMIZATION FOR OBJECT DETECTION IN HIGH RESOLUTION IMAGES
- Blog: Structured Variable Selection with Sparsity-Inducing Norms
- Blog: Accelerated Mini-batch Randomized Block Coordinate Descent Method
- Blog: Following Curved Regularized Optimization Solution Paths
- Blog: Screening Rules and its Complexity for Active Set Identification
- Blog: Sparser Kernel Herding with Pairwise Conditional Gradients without Swap Steps
- Blog: Tuning SMT with a Large Number of Features via Online Feature Grouping
- Blog: Fast and accessible morphology-free functional fluorescence imaging analysis
- Blog: Accelerated Variance Reduced Block Coordinate Descent
- Blog: Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators
- Blog: A Complete Analysis of the l_1, p Group-Lasso
- Blog: Predicting Census Survey Response Rates via Interpretable Nonparametric Additive Models with Structured Interactions
- Blog: Sparse Gaussian Conditional Random Fields: Algorithms, Theory, and Application to Energy Forecasting
- Blog: Proximal Quasi-Newton for Computationally Intensive L1-regularized M-estimators
- Blog: Hybrid Random/Deterministic Parallel Algorithms for Nonconvex Big Data Optimization
- Blog: Adaptive Forward-Backward Greedy Algorithm for Sparse Learning with Linear Models
- Blog: Picasso: A Sparse Learning Library for High Dimensional Data Analysis in R and Python
- Blog: Covariance-Based Activity Detection in Cooperative Multi-Cell Massive MIMO: Scaling Law and Efficient Algorithms
- Blog: SpicyMKL: a fast algorithm for Multiple Kernel Learning with thousands of kernels
- Blog: A Light Touch for Heavily Constrained SGD
- Blog: A Fast Successive QP Algorithm for General Mean-Variance Portfolio Optimization
- Blog: Efficient Network Automatic Relevance Determination
- Blog: Fast Sparse Group Lasso
- Blog: Accelerated Stochastic Greedy Coordinate Descent by Soft Thresholding Projection onto Simplex
- Blog: Proximal methods for the latent group lasso penalty
- Blog: New Active-Set Frank-Wolfe Variants for Minimization over the Simplex and the $\ell_1$-Ball
- Blog: MPGL: An Efficient Matching Pursuit Method for Generalized LASSO
- Blog: Principal Component Hierarchy for Sparse Quadratic Programs
- Blog: Proximal methods for the latent group lasso penalty
- Blog: Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
- Blog: A Fast Active Set Block Coordinate Descent Algorithm for ℓ1-regularized least squares
- Blog: Exploring Large Feature Spaces with Hierarchical Multiple Kernel Learning
- Blog: Pairwise Conditional Gradients without Swap Steps and Sparser Kernel Herding
- Blog: Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization
- Blog: Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence
- Blog: Best Subset Selection in Reduced Rank Regression
- Blog: High-dimensional Bayesian Optimization with Group Testing
- Blog: Structured Variable Selection with Sparsity-Inducing Norms
- Blog: SVD-Based Screening for the Graphical Lasso
- Blog: Fast Block Coordinate Descent for Sparse Group Lasso
- Blog: Dual Decomposed Learning with Factorwise Oracle for Structural SVM of Large Output Domain
- Blog: Sparse Inverse Covariance Matrix Estimation Using Quadratic Approximation
- Blog: Efficient active learning of sparse halfspaces
Showing 60 of 202 papers.
History & citation
Current · Permanent link
- Primal Dual Active Set Methods for Sparse Recovery merged into this direction (75% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_active_set_optimization_fdea1d1a,
title = {active-set optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/active-set-optimization/rdr_fdea1d1a559d40d582ec43a593af93ea},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 2, frozen text):
@misc{lacuna_active_set_optimization_fdea1d1a_v2,
title = {active-set optimization},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/active-set-optimization/rdr_fdea1d1a559d40d582ec43a593af93ea/v/2},
note = {Version 2, frozen 2026-10-04. Accessed 2026-11-20},
}