Approximation and decomposition properties of some classes of locally d.c. functions

DOI10.1007/BF01580764zbMath0666.49005OpenAlexW2024615944MaRDI QIDQ1116447

Mireille L. Bougeard, Jean-Paul Penot

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01580764

zbMATH Keywords

difference of two convex functionsLipschitzian functionsinf-convolutionapproximation procedurelower-\(C^ 2\) functionslocally d.c. functionsMoreau-Yosida process

Mathematics Subject Classification ID

Nonlinear programming (90C30) Nonsmooth analysis (49J52) Decomposition methods (49M27) Convexity of real functions of several variables, generalizations (26B25) Methods of successive quadratic programming type (90C55)

Related Items

Generalized derivatives and nonsmooth optimization, a finite dimensional tour (with comments and rejoinder) ⋮ Helping you finding an appropriate regularization process ⋮ Cyclic hypomonotonicity, cyclic submonotonicity, and integration ⋮ Morse theory for some lower-\(C^ 2\) functions in finite dimension ⋮ Approximately convex functions and approximately monotonic operators ⋮ Approximation by Delta-Convex Mappings in Certain Spaces ⋮ Strong concavity properties of indirect utility functions in multisector optimal growth models ⋮ Caractérisation de la convergence au sens de Mosco en terme d'approximations inf-convolutives ⋮ Sub-hessians, super-hessians and conjugation ⋮ Topologies and convergences on the space of convex functions ⋮ The directional subdifferential of the difference of two convex functions ⋮ Characterization and recognition of d.c. functions ⋮ Competitive equilibrium cycles for small discounting in discrete-time two-sector optimal growth models ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ Approximate convexity and submonotonicity. ⋮ Towards minimal assumptions for the infimal convolution regularization ⋮ Differential properties of the Moreau envelope ⋮ Solving DC programs using the cutting angle method ⋮ Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method ⋮ Prox-regular functions in Hilbert spaces ⋮ On parametric nonlinear programming ⋮ Tangentially ds functions ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ Some nonlinear characterizations of reflexive Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On functions representable as a difference of convex functions
• On the number of periodic trajectories for a Hamiltonian flow on a convex energy surface
• Convex analysis and measurable multifunctions
• Convexification procedures and decomposition methods for nonconvex optimization problems
• Nonlinear optimization in finite dimensions. Morse theory, Chebyshev approximation, transversality, flows, parametric aspects
• Existence de solutions pour des problèmes d'optimisation non convexe
• Fréchet differentiability of convex functions
• On Functions Representable as a Supremum of a Family of Smooth Functions
• Strong and Weak Convexity of Sets and Functions
• Optimization and nonsmooth analysis
• Submonotone Subdifferentials of Lipschitz Functions
• Submonotone mappings and the proximal point algorithm
• Prox-mappings associated with a pair of Legendre conjugate functions
• Problème des inégalités. Applications à la programmation et au contrôle optimal
• Nonconvex Optimization Problems Depending on a Parameter
• Generic Frechet-Differentiability and Perturbed Optimization Problems in Banach Spaces
• Caristi's fixed point theorem and metric convexity
• Extension of Lipschitz functions