Pages that link to "Item:Q879964"
From MaRDI portal
The following pages link to Smoothing technique and its applications in semidefinite optimization (Q879964):
Displayed 34 items.
- Sublinear time algorithms for approximate semidefinite programming (Q304246) (← links)
- 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)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← 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)
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems (Q908377) (← links)
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network (Q1716567) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← 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)
- Minimizing memory effects of a system (Q2264125) (← links)
- Inverse optimal control for discrete-time finite-horizon linear quadratic regulators (Q2280983) (← links)
- Black-box learning of multigrid parameters (Q2291999) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks (Q2339924) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- Overlapping radial basis function interpolants for spectrally accurate approximation of functions of eigenvalues with application to buckling of composite plates (Q2364220) (← links)
- Efficient, certifiably optimal clustering with applications to latent variable graphical models (Q2425167) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Phase recovery, MaxCut and complex semidefinite programming (Q2515033) (← links)
- Sparse PCA: Convex Relaxations, Algorithms and Applications (Q2802550) (← links)
- Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
- GMRES-Accelerated ADMM for Quadratic Objectives (Q4554067) (← links)
- (Q4636989) (← links)
- On the acceleration of the double smoothing technique for unconstrained convex optimization problems (Q4981856) (← links)
- An acceleration procedure for optimal first-order methods (Q5746718) (← links)