Pages that link to "Item:Q623454"
From MaRDI portal
The following pages link to Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454):
Displayed 8 items.
- Implementation of an optimal first-order method for strongly convex total variation regularization (Q438730) (← links)
- Smoothing proximal gradient method for general structured sparse regression (Q439167) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Templates for convex cone problems with applications to sparse signal recovery (Q1762456) (← links)
- An alternating direction method for finding Dantzig selectors (Q1927184) (← links)
- Iteration-complexity of first-order penalty methods for convex programming (Q1949272) (← links)
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming (Q1949275) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)