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

DOI10.1017/S0004972700036984zbMath0742.90071MaRDI QIDQ3979907

Juan-Enrique Martinez-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)

Related Items (23)

Approximate Euler-Lagrange inclusion, approximate transversality condition, and sensitivity analysis of convex parametric problems of calculus of variations ⋮ Jets, generalised convexity, proximal normality and differences of functions ⋮ Calculus rules for global approximate minima and applications to approximate subdifferential calculus ⋮ Optimality conditions for the difference of convex set-valued mappings ⋮ On minima of the difference of functions ⋮ The deconvolution operation in convex analysis: an introduction ⋮ Necessary optimality conditions for a set-valued fractional extremal programming problem under inclusion constraints ⋮ Characterizing approximate global minimizers of the difference of two abstract convex functions with applications ⋮ Subdifferential calculus without qualification conditions, using approximate subdifferentials: A survey ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver ⋮ Optimality conditions in DC-constrained mathematical programming problems ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ The directional subdifferential of the difference of two convex functions ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ On Computing the Mordukhovich Subdifferential Using Directed Sets in Two Dimensions ⋮ An extension of D.C. duality theory, with an appendix on ∗-subdifferentials ⋮ Simplified optimality conditions for minimizing the difference of vector-valued functions ⋮ Refined optimality conditions for differences of convex functions ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ On difference convexity of locally Lipschitz functions ⋮ Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints

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

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