A formula on the approximate subdifferential of the difference of convex functions

DOI10.1017/S0004972700036984MaRDI QIDQ3979907zbMATHFDO

Authors Juan-Enrique Martínez-Legaz, Alberto Seeger

Publication date 26 June 1992

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

\(\varepsilon\)-subdifferentialdc-programminglocally convex linear topological space

Mathematics Subject Classification ID

Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Nonsmooth analysis (49J52)

Cites work

• A duality principle for non-convex optimisation and the calculus of variations
• Limiting behaviour of the approximate first order and second order directional derivatives for a convex function

Cited in

(28)

• Refined optimality conditions for differences of convex functions
• The deconvolution operation in convex analysis: an introduction
• On the subdifferentiability of the difference of two functions and local minimization
• An extension of D.C. duality theory, with an appendix on ∗-subdifferentials
• Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations
• Calculus rules for global approximate minima and applications to approximate subdifferential calculus
• Necessary and sufficient optimality conditions in DC semi-infinite programming
• Simplified optimality conditions for minimizing the difference of vector-valued functions
• Some conjugation formulas and subdifferential formulas of convex analysis revisited
• Weak convexity and approximate subdifferentials
• On difference convexity of locally Lipschitz functions
• On minima of the difference of functions
• scientific article; zbMATH DE number 6704308 (Why is no real title available?)
• Jets, generalised convexity, proximal normality and differences of functions
• Optimality conditions in DC-constrained mathematical programming problems
• Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
• On the optimality conditions for D.C. vector optimization problems
• Optimality conditions for the difference of convex set-valued mappings
• The directional subdifferential of the difference of two convex functions
• On computing the Mordukhovich subdifferential using directed sets in two dimensions
• Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey
• Sufficient optimality conditions for a bilevel semivectorial D.C. problem
• On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
• A formula on the subdifferential of the deconvolution of convex functions
• scientific article; zbMATH DE number 1873045 (Why is no real title available?)
• Characterizing approximate global minimizers of the difference of two abstract convex functions with applications
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints

This page was built for publication: A formula on the approximate subdifferential of the difference of convex functions

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