On duality for nonconvex minimization problems within the framework of abstract convexity

2021/10/01 by Ewa M. Bednarczuk, Bednarczuk, Ewa M., Monika Syga +1
Computer Science · Mathematics · #FOS: Mathematics #Mathematical Inequalities and Applications #Optimization and Control (math.OC) #Optimization and Variational Analysis

paper · pdf · doi:10.48550/arxiv.2110.00611

openalex publication_date 2021/10/01 · openalex created_date 2022/07/25 · openalex updated_date 2026/07/28

Abstract

By applying the perturbation function approach, we propose the Lagrangian and the conjugate duals for minimization problems of the sum of two, generally nonconvex, functions. The main tools are the Φ-convexity theory and minimax theorems for Φ-convex functions. We provide conditions ensuring zero duality gap and introduce Φ-Karush-Kuhn-Tucker conditions that characterize solutions to primal and dual problems. We also discuss the relationship between the dual problems introduced in the present investigation and some conjugate-type duals existing in the literature.

Related

• Lagrangian duality for nonconvex optimization problems with abstract convex functions
• Duality for Composite Optimization Problem within the Framework of Abstract Convexity
• Duality suitable for a class of non-convex optimization problems
• Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
• Duality for Non Convex Composite Functions via the Fenchel Rockafellar Perturbation Framework