Pages that link to "Item:Q2349117"
From MaRDI portal
The following pages link to Sparse learning via Boolean relaxations (Q2349117):
Displayed 26 items.
- A continuous relaxation of the constrained \(\ell_2-\ell_0\) problem (Q2036185) (← links)
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Sparse regression at scale: branch-and-bound rooted in first-order optimization (Q2097642) (← links)
- Ideal formulations for constrained convex optimization problems with indicator variables (Q2118117) (← links)
- The backbone method for ultra-high dimensional sparse machine learning (Q2163249) (← links)
- New insights on the optimality conditions of the \(\ell_2-\ell_0\) minimization problem (Q2203360) (← links)
- Sparse regression: scalable algorithms and empirical performance (Q2225311) (← links)
- A discussion on practical considerations with sparse regression methodologies (Q2225315) (← links)
- Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
- Accelerated iterative hard thresholding algorithm for \(l_0\) regularized regression problem (Q2307753) (← links)
- The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables (Q2670502) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- (Q4998944) (← links)
- Online Learning of a Weighted Selective Naive Bayes Classifier with Non-convex Optimization (Q5016640) (← links)
- Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints (Q5060505) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- Scalable Algorithms for the Sparse Ridge Regression (Q5148400) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- A Unified View of Exact Continuous Penalties for $\ell_2$-$\ell_0$ Minimization (Q5359501) (← links)
- A new perspective on low-rank optimization (Q6052053) (← links)
- Handling symmetries in mixed-integer semidefinite programs (Q6057246) (← links)
- On Integrality in Semidefinite Programming for Discrete Optimization (Q6130544) (← links)
- Nearly Dimension-Independent Sparse Linear Bandit over Small Action Spaces via Best Subset Selection (Q6153988) (← links)
- Subset Selection and the Cone of Factor-Width-<i>k</i> Matrices (Q6195312) (← links)