Smoothing technique and its applications in semidefinite optimization
From MaRDI portal
Publication:879964
DOI10.1007/s10107-006-0001-8zbMath1126.90058OpenAlexW2088411705MaRDI 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
Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Overlapping radial basis function interpolants for spectrally accurate approximation of functions of eigenvalues with application to buckling of composite plates ⋮ Discrete-time inverse linear quadratic optimal control over finite time-horizon under noisy output measurements ⋮ Sublinear time algorithms for approximate semidefinite programming ⋮ Fast First-Order Algorithms for Packing–Covering Semidefinite Programs ⋮ Mixed-Projection Conic Optimization: A New Paradigm for Modeling Rank Constraints ⋮ GMRES-Accelerated ADMM for Quadratic Objectives ⋮ Finding Sparse Solutions for Packing and Covering Semidefinite Programs ⋮ New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure ⋮ An Approximation Scheme for Distributionally Robust PDE-Constrained Optimization ⋮ Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Domain adaptation and sample bias correction theory and algorithm for regression ⋮ First-order methods of smooth convex optimization with inexact oracle ⋮ Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming ⋮ Unnamed Item ⋮ Efficient, certifiably optimal clustering with applications to latent variable graphical models ⋮ Convex approximations to sparse PCA via Lagrangian duality ⋮ Testing the nullspace property using semidefinite programming ⋮ Barrier subgradient method ⋮ A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems ⋮ An Approximation Scheme for Distributionally Robust Nonlinear Optimization ⋮ An optimal method for stochastic composite optimization ⋮ Descent gradient methods for nonsmooth minimization problems in ill-posed problems ⋮ Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming ⋮ A simple nearly optimal restart scheme for speeding up first-order methods ⋮ A smoothing proximal gradient algorithm with extrapolation for the relaxation of \({\ell_0}\) regularization problem ⋮ A fresh variational-analysis look at the positive semidefinite matrices world ⋮ Variable smoothing for convex optimization problems using stochastic gradients ⋮ 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 ⋮ Adaptive smoothing algorithms for nonsmooth composite convex minimization ⋮ Minimizing memory effects of a system ⋮ An acceleration procedure for optimal first-order methods ⋮ Smoothing methods for nonsmooth, nonconvex minimization ⋮ A survey on conic relaxations of optimal power flow problem ⋮ Constraint qualifications for Karush-Kuhn-Tucker conditions in multiobjective optimization ⋮ Inverse optimal control for discrete-time finite-horizon linear quadratic regulators ⋮ A dual reformulation and solution framework for regularized convex clustering problems ⋮ Sparse PCA: Convex Relaxations, Algorithms and Applications ⋮ Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization ⋮ Phase recovery, MaxCut and complex semidefinite programming ⋮ Black-box learning of multigrid parameters ⋮ Oracle-Based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs ⋮ On the acceleration of the double smoothing technique for unconstrained convex optimization problems ⋮ Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms ⋮ \(l^1\)-weighted regularization for the problem of recovering sparse initial conditions in parabolic equations from final measurements ⋮ Unnamed Item ⋮ Optimal information dissemination strategy to promote preventive behaviors in multilayer epidemic networks ⋮ Unnamed Item ⋮ A variable smoothing algorithm for solving convex optimization problems
Cites Work
This page was built for publication: Smoothing technique and its applications in semidefinite optimization
