Smoothing technique and its applications in semidefinite optimization
From MaRDI portal
Publication:879964
DOI10.1007/s10107-006-0001-8zbMath1126.90058MaRDI QIDQ879964
Publication date: 10 May 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-006-0001-8
90C22: Semidefinite programming
90C25: Convex programming
90C60: Abstract computational complexity for mathematical programming problems
Related Items
Unnamed Item, GMRES-Accelerated ADMM for Quadratic Objectives, On the acceleration of the double smoothing technique for unconstrained convex optimization problems, An acceleration procedure for optimal first-order methods, Sublinear time algorithms for approximate semidefinite programming, Domain adaptation and sample bias correction theory and algorithm for regression, First-order methods of smooth convex optimization with inexact oracle, An optimal method for stochastic composite optimization, A fresh variational-analysis look at the positive semidefinite matrices world, Adaptive smoothing algorithms for nonsmooth composite convex minimization, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming, Convex approximations to sparse PCA via Lagrangian duality, Testing the nullspace property using semidefinite programming, Barrier subgradient method, Smoothing methods for nonsmooth, nonconvex minimization, Descent gradient methods for nonsmooth minimization problems in ill-posed problems, New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure, Projected primal-dual gradient flow of augmented Lagrangian with application to distributed maximization of the algebraic connectivity of a network, Accelerated first-order methods for hyperbolic programming, A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems, Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming, Minimizing memory effects of a system, Inverse optimal control for discrete-time finite-horizon linear quadratic regulators, Black-box learning of multigrid parameters, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks, A variable smoothing algorithm for solving convex optimization problems, Overlapping radial basis function interpolants for spectrally accurate approximation of functions of eigenvalues with application to buckling of composite plates, Efficient, certifiably optimal clustering with applications to latent variable graphical models, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, Phase recovery, MaxCut and complex semidefinite programming, Sparse PCA: Convex Relaxations, Algorithms and Applications, Fast First-Order Algorithms for Packing–Covering Semidefinite Programs
Cites Work
