The following pages link to (Q3134091):
Displayed 12 items.
- A quadratic penalty method for hypergraph matching (Q683734) (← links)
- A gradient projection algorithm with a new stepsize for nonnegative sparsity-constrained optimization (Q2007126) (← links)
- An extended Newton-type algorithm for \(\ell_2\)-regularized sparse logistic regression and its efficiency for classifying large-scale datasets (Q2033090) (← links)
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models (Q2048127) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- Revisiting augmented Lagrangian duals (Q2097636) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
- Matrix optimization over low-rank spectral sets: stationary points and local and global minimizers (Q2302834) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
- (Q4998877) (← links)
- An Inexact Projected Gradient Method for Sparsity-Constrained Quadratic Measurements Regression (Q5384750) (← links)