On functions representable as a difference of convex functions

Cited In (84)

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

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)