A formula on the approximate subdifferential of the difference of convex functions. (English) Zbl 0742.90071
A method of approximating the \(\varepsilon\)-subdifferential of a difference \(f=g-h\) of two convex functions \(g\), \(h\) on a locally convex linear topological space is given.
Reviewer: D.Butnariu (Haifa)
MSC:
| 90C30 | Nonlinear programming |
| 49J52 | Nonsmooth analysis |
| 90C25 | Convex programming |
| 90C26 | Nonconvex programming, global optimization |
References:
| [1] | Kutateladze, Soviet Math. Dokl. 20 pp 391– (1979) |
| [2] | Hiriart-Urruty, Nonsmooth optimization and related topics pp 219– (1989) · doi:10.1007/978-1-4757-6019-4_13 |
| [3] | Hiriart-Urruty, Convexity and duality in optimization: Lecture Notes in Econom, and Math. Systems 256 pp 37– (1986) · doi:10.1007/978-3-642-45610-7_3 |
| [4] | Martínez-Legaz, Generalized convexity and fractional programming with economic applications: Lect. Notes in Econom, and Math. Systems 345 pp 198– (1990) · doi:10.1007/978-3-642-46709-7_14 |
| [5] | DOI: 10.1007/BF00250669 · Zbl 0411.49012 · doi:10.1007/BF00250669 |
| [6] | Singer, Bull. Austral. Math. Soc. 29 pp 193– (1979) |
| [7] | Hiriart-Urruty, Convex analysis and optimization: Research Notes in Mathematics 57 pp 43– (1982) · Zbl 0536.26007 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
