On functions representable as a difference of convex functions

Cited in

(83)

Alternating minimization for regression with tropical rational functions
Directional differentiability, coexhausters, codifferentials and polyhedral DC functions
Data fitting with signomial programming compatible difference of convex functions
Concave-Convex PDMP-based Sampling
Condition number minimization in Euclidean Jordan algebras
Fréchet and Gateaux gH-differentiability for interval valued functions of multiple variables
Maximal pairs of convex sets and Zalgaller's minimal representation of dc-functions
Interpolation results for pathwise Hamilton-Jacobi equations
An introduction to Reshetnyak's theory of subharmonic distances
On difference-of-SOS and difference-of-convex-SOS decompositions for polynomials
Open issues and recent advances in DC programming and DCA
Convex non-convex variational models
Compensated convex-based transforms for image processing and shape interrogation
A refined inertial DC algorithm for DC programming
Weighted dynamic estimates for convex and subharmonic functions on time scales
Delta-convex structure of the singular set of distance functions
Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations
A boosted-DCA with power-sum-DC decomposition for linearly constrained polynomial programs
On the rate of convergence of the difference-of-convex algorithm (DCA)
A characterization of sets in ${\mathbb R}^2$ with DC distance function
A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling
Intersection Disjunctions for Reverse Convex Sets
Minimal pairs of convex sets which share a recession cone
Curvatures for unions of WDC sets
Roots of Gårding hyperbolic polynomials
Differentiability of the distance function and points of multi-valuedness of the metric projection in Banach space
Composite difference-MAX programs for modern statistical estimation problems
DC programming and DCA: thirty years of developments
Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems
Confidence Bands for a Log-Concave Density
A framework of discrete DC programming by discrete convex analysis
Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
Variations and extension of the convex-concave procedure
Normal cycles and curvature measures of sets with d.c. boundary
Double bundle method for finding Clarke stationary points in nonsmooth DC programming
Approximation and decomposition properties of some classes of locally d.c. functions
On the subdifferentiability of the difference of two functions and local minimization
Estimation from nonlinear observations via convex programming with application to bilinear regression
A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations
Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
The formulas for the representation of functions of two variables as a difference of sublinear functions
DC programming: overview.
DC calculus
A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem
A general cone decomposition theory based on efficiency
An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels
A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
Kinematic formulas for sets defined by differences of convex functions
Convergence guarantees for a class of non-convex and non-smooth optimization problems
Properties of distance functions on convex surfaces and applications
D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems
A sharp augmented Lagrangian-based method in constrained non-convex optimization
On a separation theorem for delta-convex functions
Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems
($\epsilon$-)efficiency in difference vector optimization
Sur une équation quasilinéaire d'ordre 2 non elliptique. (On a quasilinear nonelliptic equation of second order)
Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
DC decomposition of nonconvex polynomials with algebraic techniques
Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering
Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation
A modified proximal point method for DC functions on Hadamard manifolds
On the representability of a function of two variables as the difference of two convex functions
Characterization and recognition of d.c. functions
On Lipschitz and D.C. surfaces of finite codimension in a Banach space
Nearest points and delta convex functions in Banach spaces
Optimization of the norm of a vector-valued DC function and applications
The directional subdifferential of the difference of two convex functions
On the diffusive-mean field limit for weakly interacting diffusions exhibiting phase transitions
Global convergence of a proximal linearized algorithm for difference of convex functions
Generalized tight $p$-frames and spectral bounds for Laplace-like operators
An extension of a Ger's result
On sets in $\mathbb{R}^d$ with DC distance function
On Korenblum convex functions
On the pervasiveness of difference-convexity in optimization and statistics
Deterministic methods in constrained global optimization: Some recent advances and new fields of application
Sequential location of two facilities: comparing random to optimal location of the first facility
On global unconstrained minimization of the difference of polyhedral functions
Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs
A sample-path approach to optimal position liquidation
Characterization of d.c. Functions in terms of quasidifferentials
Integral geometric regularity
Solving DC programs using the cutting angle method

This page was built for publication: On functions representable as a difference of convex functions

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