The following pages link to (Q4633050):
Displaying 12 items.
- Sparse classification: a scalable discrete optimization perspective (Q2071494) (← links)
- Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
- Nonconvex regularization for sparse neural networks (Q2168678) (← links)
- An inexact augmented Lagrangian method for computing strongly orthogonal decompositions of tensors (Q2307705) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection (Q4995087) (← links)
- Sparsity constrained optimization problems via disjunctive programming (Q5039398) (← links)
- (Q5054600) (← links)
- Approximation Bounds for Sparse Programs (Q5073726) (← links)
- A low-cost alternating projection approach for a continuous formulation of convex and cardinality constrained optimization (Q6063782) (← links)
- Estimation of \(l_0\) norm penalized models: a statistical treatment (Q6554254) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
