Pages that link to "Item:Q5419639"
From MaRDI portal
The following pages link to On first-order algorithms for<i>l</i><sub>1</sub>/nuclear norm minimization (Q5419639):
Displayed 14 items.
- Solving variational inequalities with monotone operators on domains given by linear minimization oracles (Q263192) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Conditional gradient algorithms for norm-regularized smooth convex optimization (Q494314) (← links)
- On the solution uniqueness characterization in the L1 norm and polyhedral gauge recovery (Q511961) (← links)
- Decomposable norm minimization with proximal-gradient homotopy algorithm (Q513723) (← links)
- Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity (Q2011725) (← links)
- On the inexact scaled gradient projection method (Q2070333) (← links)
- Estimating shape parameters of piecewise linear-quadratic problems (Q2165586) (← links)
- Inexact gradient projection method with relative error tolerance (Q2696906) (← links)
- On the convergence rate of scaled gradient projection method (Q4559401) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Efficient Search of First-Order Nash Equilibria in Nonconvex-Concave Smooth Min-Max Problems (Q5158768) (← links)
- On Solving Large-Scale Polynomial Convex Problems by Randomized First-Order Algorithms (Q5252231) (← links)
- Optimal Algorithms for Stochastic Complementary Composite Minimization (Q6136660) (← links)