The following pages link to (Q4558490):
Displaying 19 items.
- Weighted thresholding homotopy method for sparsity constrained optimization (Q2082209) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- GSDAR: a fast Newton algorithm for \(\ell_0\) regularized generalized linear models with statistical guarantee (Q2135875) (← links)
- A data-driven line search rule for support recovery in high-dimensional data analysis (Q2157522) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- Optimality conditions for rank-constrained matrix optimization (Q2314061) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- A primal and dual active set algorithm for truncated \(L_1\) regularized logistic regression (Q2691265) (← links)
- (Q4558147) (← links)
- A Tight Bound of Hard Thresholding (Q4558539) (← links)
- On the Solution of <i>ℓ</i><sub>0</sub>-Constrained Sparse Inverse Covariance Estimation Problems (Q4995086) (← links)
- (Q4998877) (← links)
- An Equivalence between Critical Points for Rank Constraints Versus Low-Rank Factorizations (Q5131960) (← links)
- (Q5148934) (← links)
- Cardinality-constrained structured data-fitting problems (Q6584338) (← links)
- Cardinality minimization, constraints, and regularization: a survey (Q6585278) (← links)
- Subspace Newton method for sparse group \(\ell_0\) optimization problem (Q6607024) (← links)
- A Lagrange–Newton algorithm for tensor sparse principal component analysis (Q6611219) (← links)
- Relaxation quadratic approximation greedy pursuit method based on sparse learning (Q6651176) (← links)
