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

DOI10.1080/02331939708844348zbMath0893.90143OpenAlexW2069477954MaRDI 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 subdifferentiald.c. duality theoryFenchel conjugation operator

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Duality theory (optimization) (49N15) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items

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

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