Pages that link to "Item:Q1949272"
From MaRDI portal
The following pages link to Iteration-complexity of first-order penalty methods for convex programming (Q1949272):
Displayed 7 items.
- Accelerated gradient methods for nonconvex nonlinear and stochastic programming (Q263185) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators (Q2340520) (← links)
- Polyhedral approximations in<i>p</i>-order cone programming (Q2926080) (← links)
- An Accelerated Linearized Alternating Direction Method of Multipliers (Q5250009) (← links)
- Iteration-complexity of first-order augmented Lagrangian methods for convex programming (Q5962727) (← links)