Pages that link to "Item:Q879964"
From MaRDI portal
The following pages link to Smoothing technique and its applications in semidefinite optimization (Q879964):
Displayed 13 items.
- Domain adaptation and sample bias correction theory and algorithm for regression (Q391745) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- A fresh variational-analysis look at the positive semidefinite matrices world (Q438781) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming (Q623454) (← links)
- Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
- Testing the nullspace property using semidefinite programming (Q633104) (← links)
- Barrier subgradient method (Q633113) (← links)
- Smoothing methods for nonsmooth, nonconvex minimization (Q715249) (← links)
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming (Q1949275) (← links)
- An acceleration procedure for optimal first-order methods (Q5746718) (← links)