A formula on the approximate subdifferential of the difference of convex functions-Reference-Cited by-同舟云学术

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

Published:1992-02 Issue:1 Volume:45 Page:37-41
ISSN:0004-9727
Container-title:Bulletin of the Australian Mathematical Society
language:en
Short-container-title:Bull. Austral. Math. Soc.

Author:

Martínez-legaz J.E.,Seeger A.

Abstract

We give a formula on the ε−subdifferential of the difference of two convex functions. As a by-product of this formula, one recovers a recent result of Hiriart-Urruty, namely, a necessary and sufficient condition for global optimality in nonconvex optimisation.

Publisher

Cambridge University Press (CUP)

Subject

General Mathematics

Reference7 articles.

1. Generalized Conjugation and Related Topics

2. Convex ε−programming;Kutateladze;Soviet Math. Dokl.,1979

3. A Fenchel-Rockafellar type duality theorem for maximization

4. From Convex Optimization to Nonconvex Optimization. Necessary and Sufficient Conditions for Global Optimality

Cited by 31 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimality Conditions in DC-Constrained Mathematical Programming Problems;Journal of Optimization Theory and Applications;2023-07-07

2. Approximate Subdifferential of the Difference of Two Vector Convex Mappings;Mathematics;2023-06-15

3. On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions;Set-Valued and Variational Analysis;2022-06-16

4. Necessary and Sufficient Optimality Conditions in DC Semi-infinite Programming;SIAM Journal on Optimization;2021-01

5. On the optimality conditions for D.C. vector optimization problems;Optimization;2020-12-02