Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations

DOI10.1007/s10898-017-0568-zzbMath1418.90201OpenAlexW2754518108MaRDI QIDQ1754446

Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico, Adil M. Bagirov

Publication date: 30 May 2018

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

Full work available at URL: https://doi.org/10.1007/s10898-017-0568-z

zbMATH Keywords

cutting plane bundle method nonconvex nonsmooth optimization DC optimization piecewise concave

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Related Items

The ABC of DC programming ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ Addendum to the paper ‘Nonsmooth DC-constrained optimization: constraint qualification and minimizing methodologies’ ⋮ An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Classification in the multiple instance learning framework via spherical separation ⋮ Piecewise linear bounding functions in univariate global optimization ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm ⋮ Finding the set of global minimizers of a piecewise affine function ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ A bundle-type method for nonsmooth DC programs ⋮ Sequential difference-of-convex programming ⋮ Incremental DC optimization algorithm for large-scale clusterwise linear regression ⋮ Optimality conditions and DC-Dinkelbach-type algorithm for generalized fractional programs with ratios of difference of convex functions ⋮ An augmented subgradient method for minimizing nonsmooth DC functions ⋮ Guest editors' preface to the special issue devoted to the 2nd international conference ``Numerical computations: theory and algorithms, June 19--25, 2016, Pizzo Calabro, Italy ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ A filter proximal bundle method for nonsmooth nonconvex constrained optimization ⋮ Proximal bundle methods for nonsmooth DC programming ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems ⋮ An inertial algorithm for DC programming ⋮ Essentials of numerical nonsmooth optimization ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations ⋮ Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions ⋮ A maximum-margin multisphere approach for binary multiple instance learning ⋮ Polyhedral separation via difference of convex (DC) programming ⋮ Essentials of numerical nonsmooth optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization

Uses Software

CPLEX

Cites Work