Identifying structure of nonsmooth convex functions by the bundle technique

DOI10.1137/080729864MaRDI QIDQ3563907zbMATH OpenOpenAlexFDO

Authors A. Daniilidis, Claudia Sagastizábal, M. V. Solodov

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

zbMATH Keywords

\({\mathcal {VU}}\)-decompositionbundle methodnonsmooth convex optimizationpartial smoothnessprimal-dual gradient structureproximal point

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• A \(\mathcal{VU}\)-point of view of nonsmooth optimization
• An approximate decomposition algorithm for convex minimization
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• A superlinear space decomposition algorithm for constrained nonsmooth convex program

Cited in

(20)

• 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
• Functions and sets of smooth substructure: relationships and examples
• On \(\mathcal{VU}\)-theory for functions with primal-dual gradient structure
• Composite proximal bundle method
• scientific article; zbMATH DE number 679865 (Why is no real title available?)
• 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
• Active-set identification with complexity guarantees of an almost cyclic 2-coordinate descent method with Armijo line search
• A \(\mathcal{VU}\)-point of view of nonsmooth optimization
• 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
• Proximal gradient \(\mathcal{VU}\)-method with superlinear convergence for nonsmooth convex optimization
• Smoothing methods for nonsmooth, nonconvex minimization

Describes a project that uses

Uses Software

• SQPlab

This page was built for publication: Identifying structure of nonsmooth convex functions by the bundle technique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3563907)