The ABC of DC programming
type: Item
instance of: scholarly article
title: The ABC of DC programming
zbMATH Open document ID: 1467.90037
author: Welington de Oliveira
published in: Set-Valued and Variational Analysis
publication date: 2021-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 26B25
zbMATH DE Number: 7344791
zbMATH Keywords: DC programming
zbMATH Keywords: variational analysis
zbMATH Keywords: nonsmooth optimization
describes a project that uses: sccf
MaRDI profile type: Publication
full work available at URL: s11228-020-00566-w
OpenAlex ID: W3095693947
cites work: DC programming and DCA: thirty years of developments
cites work: Duality in nonconvex optimization
cites work: Q3720308
cites work: Q3569180
cites work: Computing B-Stationary Points of Nonsmooth DC Programs
cites work: Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
cites work: Accelerating the DC algorithm for smooth functions
cites work: The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
cites work: An inertial algorithm for DC programming
cites work: A general double-proximal gradient algorithm for d.c. programming
cites work: Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
cites work: Sequential difference-of-convex programming
cites work: A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
cites work: Convex analysis and global optimization
cites work: Numerical Nonsmooth Optimization
cites work: On difference convexity of locally Lipschitz functions
cites work: Beyond canonical dc-optimization: the single reverse polar problem
cites work: Solving polyhedral d.c. optimization problems via concave minimization
cites work: Minimizing a sum of clipped convex functions
cites work: Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies
cites work: Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
cites work: Convex Analysis
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Q3996569
cites work: A parametric characterization of local optimality
cites work: Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
cites work: Convex analysis approach to d. c. programming: Theory, algorithms and applications
cites work: A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
cites work: Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
cites work: Proximal bundle methods for nonsmooth DC programming
cites work: Global convergence of a proximal linearized algorithm for difference of convex functions
cites work: How to regularize a difference of convex functions
cites work: On the Convergence to Stationary Points of Deterministic and Randomized Feasible Descent Directions Methods
DOI: 10.1007/S11228-020-00566-W
description: scientific article; zbMATH DE number 7344791