Pages that link to "Item:Q2515043"
From MaRDI portal
The following pages link to Complexity analysis of interior point algorithms for non-Lipschitz and nonconvex minimization (Q2515043):
Displaying 6 items.
- \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization (Q6181376) (← links)
- Complexity of finite-sum optimization with nonsmooth composite functions and non-Lipschitz regularization (Q6579994) (← links)
- Complexity of a projected Newton-CG method for optimization with bounds (Q6608031) (← links)
- \(k\) block sparse vector recovery via block \(\ell_1-\ell_2\) minimization (Q6612074) (← links)
- A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization (Q6642793) (← links)
- Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)