Pages that link to "Item:Q2919411"
From MaRDI portal
The following pages link to A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory (Q2919411):
Displayed 12 items.
- A globally convergent algorithm for Lasso-penalized mixture of linear regression models (Q1662084) (← links)
- DC formulations and algorithms for sparse optimization problems (Q1749449) (← links)
- Multiple-source adaptation theory and algorithms (Q2035631) (← links)
- A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations (Q2163076) (← links)
- Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
- Robustness of learning algorithms using hinge loss with outlier indicators (Q2292231) (← links)
- Computing B-Stationary Points of Nonsmooth DC Programs (Q2976143) (← links)
- A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints (Q5057970) (← links)
- Sparse Principal Component Analysis in Hilbert Space (Q5177962) (← links)
- A Scaled Gradient Projection Method for Bayesian Learning in Dynamical Systems (Q5254793) (← links)
- DC Algorithm for Extended Robust Support Vector Machine (Q5380706) (← links)
- Robust support vector quantile regression with truncated pinball loss (RSVQR) (Q6080392) (← links)