On difference convexity of locally Lipschitz functions

DOI10.1080/02331931003770411zbMath1237.46007OpenAlexW2046981034WikidataQ56935516 ScholiaQ56935516MaRDI QIDQ3112496

Jonathan M. Borwein, Miroslav Bačák

Publication date: 10 January 2012

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331931003770411

zbMATH Keywords

locally Lipschitz functiondelta-convex functioncontinuous convex function

Mathematics Subject Classification ID

Normed linear spaces and Banach spaces; Banach lattices (46B99) Convex functions and convex programs in convex geometry (52A41) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Related Items

The ABC of DC programming ⋮ 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 ⋮ ON THE CONVERGENCE RATE OF POTENTIALS OF BRENIER MAPS ⋮ Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs ⋮ Positively homogeneous functions revisited ⋮ Approximation by Delta-Convex Mappings in Certain Spaces ⋮ A modified proximal point method for DC functions on Hadamard manifolds ⋮ Markov chain stochastic DCA and applications in deep learning with PDEs regularization ⋮ Convergence analysis of a proximal point algorithm for minimizing differences of functions ⋮ Applications of convex analysis within mathematics ⋮ 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 ⋮ Maps with the Radon-Nikodým property ⋮ A non-DC function which is DC along all convex curves ⋮ Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning ⋮ DC programming and DCA: thirty years of developments ⋮ On sets in \(\mathbb{R}^d\) with DC distance function ⋮ The formulas for the representation of functions of two variables as a difference of sublinear functions ⋮ NEAREST POINTS AND DELTA CONVEX FUNCTIONS IN BANACH SPACES ⋮ Optimality conditions for minimizing the difference of nonconvex vector-valued mappings ⋮ On Lagrange Duality for Several Classes of Nonconvex Optimization Problems ⋮ 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 ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some new Farkas-type results for inequality systems with DC functions
• Delta-semidefinite and delta-convex quadratic forms in Banach spaces
• On the subdifferentiability of the difference of two functions and local minimization
• The conjugate of the difference of convex functions
• Duality in nonconvex optimization
• Essentially smooth Lipschitz functions
• Characterizing global optimality for DC optimization problems under convex inequality constraints
• Techniques of variational analysis
• Non-cooperative games
• ON CONNECTIONS BETWEEN DELTA-CONVEX MAPPINGS AND CONVEX OPERATORS
• A General Formula on the Conjugate of the Difference of Functions
• A Short Proof of a Theorem on Compositions of D.C. Mappings
• Duality algorithms for nonconvex variational principles
• Continuity and Differentiability Properties of Convex Operators
• A formula on the approximate subdifferential of the difference of convex functions
• Convex functions on Banach spaces not containing ℓ₁
• Quotients of Continuous Convex Functions on Nonreflexive Banach Spaces