On some geometric conditions for minimality of DCH-functions via DC-duality approach

DOI10.1007/s10898-017-0552-7zbMath1386.49019OpenAlexW2744776666MaRDI QIDQ1685589

Didem Tozkan, Yalçın Küçük, Küçük, Mahide

Publication date: 14 December 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-017-0552-7

zbMATH Keywords

Minkowski differenceDC-functionsquasidifferentialDCH-functions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) Optimality conditions (49K99)

Cites Work

• Generalized differentials of nonsmooth functions, and necessary conditions for an extremum
• Properties of generalized differentials
• Maximum principle in the problem of time optimal response with nonsmooth constraints
• Duality in D. C. programming: The case of several D. C. constraints
• Minimal pairs of convex compact sets
• Reduction of quasidifferentials and minimal representations
• Quasidifferentiable functions and pairs of convex compact sets
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• On the cones of tangents with applications to mathematical programming
• Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
• Approximate subdifferentials and applications II
• Minimization of a quasi-differentiable function in a quasi-differentiable set
• Exhausters af a positively homogeneous function^*
• On Optimality Conditions in Quasidifferentiable Optimization
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item