An extension of D.C. duality theory, with an appendix on ∗-subdifferentials

DOI10.1080/02331939708844348zbMath0893.90143MaRDI QIDQ4372095

Ivan Singer, Juan-Enrique Martinez-Legaz

Publication date: 17 February 1998

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939708844348

zbMATH Keywords

generalized subdifferential; d.c. duality theory; Fenchel conjugation operator

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

49J52: Nonsmooth analysis

49N15: Duality theory (optimization)

06A15: Galois correspondences, closure operators (in relation to ordered sets)

Related Items

What is quasiconvex analysis?, Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver

Cites Work

• The conjugate of the difference of convex functions
• Some relations between dualities, polarities, coupling functionals, and conjugations
• Infimal generators and dualities between complete lattices
• Duality in nonconvex optimization
• Remarks on Galois lattices
• V -dualities and ⊥-dualities
• A formula on the approximate subdifferential of the difference of convex functions
• An Extension of Duality-Stability Relations to Nonconvex Optimization Problems
• A Fenchel-Rockafellar type duality theorem for maximization
• Duality theorems for certain programs involving minimum or maximum operations
• Dualities
• Subdifferentials with respect to dualities