The following pages link to (Q4998877):
Displaying 17 items.
- Partial gradient optimal thresholding algorithms for a class of sparse optimization problems (Q2079693) (← links)
- A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
- Gradient projection Newton algorithm for sparse collaborative learning using synthetic and real datasets of applications (Q2104053) (← links)
- Quaternion matrix optimization: motivation and analysis (Q2139274) (← links)
- Gradient projection Newton pursuit for sparsity constrained optimization (Q2168680) (← links)
- Newton method for \(\ell_0\)-regularized optimization (Q2665935) (← links)
- Newton-type optimal thresholding algorithms for sparse optimization problems (Q2676159) (← links)
- A greedy Newton-type method for multiple sparse constraint problem (Q2696970) (← links)
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization (Q5020852) (← links)
- (Q5159402) (← links)
- Newton Hard-Thresholding Pursuit for Sparse Linear Complementarity Problem via A New Merit Function (Q5857635) (← links)
- Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms (Q6041666) (← links)
- Global and Quadratic Convergence of Newton Hard-Thresholding Pursuit (Q6312211) (← links)
- Penalty method for the sparse portfolio optimization problem (Q6574067) (← 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)
- \texttt{skscope}: fast sparsity-constrained optimization in Python (Q6638539) (← links)
