Identifying Structure of Nonsmooth Convex Functions by the Bundle Technique
From MaRDI portal
Publication:3563907
DOI10.1137/080729864zbMath1191.90066MaRDI QIDQ3563907
Aris Daniilidis, Mikhail V. Solodov, Claudia A. Sagastizábal
Publication date: 1 June 2010
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/080729864
bundle method; proximal point; nonsmooth convex optimization; primal-dual gradient structure; \({\mathcal {VU}}\)-decomposition; partial smoothness
Related Items
Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search, A splitting bundle approach for non-smooth non-convex minimization, A proximal bundle method for nonsmooth nonconvex functions with inexact information, Profit sharing mechanisms in multi-owned cascaded hydrosystems, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, Composite proximal bundle method, Smoothing methods for nonsmooth, nonconvex minimization, On the local convergence analysis of the gradient sampling method for finite max-functions, A fast gradient and function sampling method for finite-max functions, A decomposition method with redistributed subroutine for constrained nonconvex optimization, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization, A conjugate gradient sampling method for nonsmooth optimization, The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function
Uses Software
