Codifferential method for minimizing nonsmooth DC functions

DOI10.1007/s10898-010-9569-xzbMath1242.90172OpenAlexW2068889684MaRDI QIDQ539496

Adil M. Bagirov, Julien Ugon

Publication date: 30 May 2011

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-010-9569-x

zbMATH Keywords

nonsmooth optimizationnonconvex optimizationDC functionssub-differentialcodifferential

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (18)

A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems ⋮ Characterizations of the solution set for a class of nonsmooth optimization problems ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ DC optimization for constructing discrete Sugeno integrals and learning nonadditive measures ⋮ A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A convergence analysis of the method of codifferential descent ⋮ Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming ⋮ Abstract convex approximations of nonsmooth functions ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Weak subgradient method for solving nonsmooth nonconvex optimization problems ⋮ The method of codifferential descent for convex and global piecewise affine optimization ⋮ Aggregate codifferential method for nonsmooth DC optimization ⋮ Direct Methods in the Parametric Moving Boundary Variational Problem

Uses Software

• NDA
• GradSamp
• PNEW
• DGM
• QSM
• LDGB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete gradient method: Derivative-free method for nonsmooth optimization
• A bundle-Newton method for nonsmooth unconstrained minimization
• A method of truncated codifferential with application to some problems of cluster analysis
• Globally convergent variable metric method for convex nonsmooth unconstrained minimization
• Piecewise linear approximations in nonconvex nonsmooth optimization
• Solving semidefinite quadratic problems within nonsmooth optimization algorithms
• A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
• A quasisecant method for minimizing nonsmooth functions
• Gradient set splitting in nonconvex nonsmooth numerical optimization
• A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
• Finding the nearest point in A polytope
• Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
• A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
• Survey of Bundle Methods for Nonsmooth Optimization
• A Method for Minimization of Quasidifferentiable Functions
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• Max–min separability
• New limited memory bundle method for large-scale nonsmooth optimization
• Algorithm 811: NDA

This page was built for publication: Codifferential method for minimizing nonsmooth DC functions