On functions representable as a difference of convex functions
From MaRDI portal
Publication:772264
DOI10.2140/pjm.1959.9.707zbMath0093.06401OpenAlexW2062058089MaRDI QIDQ772264
Publication date: 1959
Published in: Pacific Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2140/pjm.1959.9.707
Related Items
Integral Geometric Regularity, Variations and extension of the convex-concave procedure, Deterministic methods in constrained global optimization: Some recent advances and new fields of application, Convergence guarantees for a class of non-convex and non-smooth optimization problems, A general cone decomposition theory based on efficiency, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Interpolation results for pathwise Hamilton-Jacobi equations, Confidence Bands for a Log-Concave Density, DC semidefinite programming and cone constrained DC optimization. I: Theory, Global convergence of a proximal linearized algorithm for difference of convex functions, D.C. representability of closed sets in reflexive Banach spaces and applications to optimization problems, A characterization of sets in ${\mathbb R}^2$ with DC distance function, A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem, Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs, Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems, Condition Number Minimization in Euclidean Jordan Algebras, Composite Difference-Max Programs for Modern Statistical Estimation Problems, A unifying framework of high-dimensional sparse estimation with difference-of-convex (DC) regularizations, Intersection Disjunctions for Reverse Convex Sets, A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes, Approximation and decomposition properties of some classes of locally d.c. functions, Kinematic formulas for sets defined by differences of convex functions, Minimal Pairs of Convex Sets Which Share a Recession Cone, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver, Differentiability of the distance function and points of multi-valuedness of the metric projection in Banach space, Curvatures for unions of WDC sets, Maximal pairs of convex sets and Zalgaller's minimal representation of dc-functions, A modified proximal point method for DC functions on Hadamard manifolds, A refined inertial DC algorithm for DC programming, The directional subdifferential of the difference of two convex functions, Directional differentiability, coexhausters, codifferentials and polyhedral DC functions, A Nonlocal Graph-PDE and Higher-Order Geometric Integration for Image Labeling, Data fitting with signomial programming compatible difference of convex functions, Weighted dynamic estimates for convex and subharmonic functions on time scales, Concave-Convex PDMP-based Sampling, Open issues and recent advances in DC programming and DCA, Characterization and recognition of d.c. functions, Approximations of semicontinuous functions with applications to stochastic optimization and statistical estimation, Characterization of d.c. Functions in terms of quasidifferentials, Normal cycles and curvature measures of sets with d.c. boundary, DC programming: overview., A sharp augmented Lagrangian-based method in constrained non-convex optimization, Solving DC programs using the cutting angle method, A framework of discrete DC programming by discrete convex analysis, On the pervasiveness of difference-convexity in optimization and statistics, Generalized tight \(p\)-frames and spectral bounds for Laplace-like operators, DC calculus, Properties of distance functions on convex surfaces and applications, Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning, Sequential location of two facilities: comparing random to optimal location of the first facility, DC programming and DCA: thirty years of developments, DC decomposition of nonconvex polynomials with algebraic techniques, Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering, Optimization of the norm of a vector-valued DC function and applications, A sample-path approach to optimal position liquidation, Estimation from nonlinear observations via convex programming with application to bilinear regression, On global unconstrained minimization of the difference of polyhedral functions, On sets in \(\mathbb{R}^d\) with DC distance function, On a separation theorem for delta-convex functions, The formulas for the representation of functions of two variables as a difference of sublinear functions, An extension of a Ger's result, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, NEAREST POINTS AND DELTA CONVEX FUNCTIONS IN BANACH SPACES, 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, On Lipschitz and D.C. surfaces of finite codimension in a Banach space, On Korenblum convex functions, A proximal point method for difference of convex functions in multi-objective optimization with application to group dynamic problems, Roots of Gårding hyperbolic polynomials, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions, Solution Approaches to Linear Fractional Programming and Its Stochastic Generalizations Using Second Order Cone Approximations, (\(\epsilon\)-)efficiency in difference vector optimization, Sur une équation quasilinéaire d'ordre 2 non elliptique. (On a quasilinear nonelliptic equation of second order), On the representability of a function of two variables as the difference of two convex functions
